Browsing Mathematics (Faculty of) by Subject "shortest path"
Now showing items 1-2 of 2
-
Compact Routing on Planar Graphs
(University of Waterloo, 2024-01-04)This thesis delves into the exploration of shortest path queries in planar graphs, with an emphasis on the utilization of space-efficient data structures. Our investigation primarily targets connected, undirected, static ... -
Finding an induced path that is not a shortest path
(Elsevier, 2021-07)We give a polynomial-time algorithm that, with input a graph G and two vertices u; v of G, decides whether there is an induced uv-path that is longer than the shortest uv-path.