Anuradha S. Mehta

Learn More
Let G = (V, E) be a directed planar graph on n = |V | vertices, and let s ∈ V be any fixed source vertex. We show that G can be preprocessed in O(n polylog n) time to build a data structure of O(n polylog n) size which can answer the following query in O(log n) time for any u, v ∈ V : report distance from s to v in the graph G\{u} We also address the(More)
  • 1