PhD Seminar • Algorithms and Complexity • Shortest Beer Path Queries in Interval Graphs
Please note: This PhD seminar will take place in DC 1304 and online.
Kevin Wu, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Ian Munro
Our interest is in paths between pairs of vertices that go through at least one of a subset of the vertices known as beer vertices. Such a path is called a beer path, and the beer distance between two vertices is the length of the shortest beer path.