Improved distance queries in planar graphs

@inproceedings{Nussbaum2011ImprovedDQ,
  title={Improved distance queries in planar graphs},
  author={Yahav Nussbaum},
  booktitle={WADS},
  year={2011}
}
There are several known data structures that answer distance queries between two arbitrary vertices in a planar graph. The tradeoff is among preprocessing time, storage space and query time. In this paper we present three data structures that answer such queries, each with its own advantage over previous data structures. The first one improves the query time of data structures of linear space. The second improves the preprocessing time of data structures with a space bound of O(n) or higher… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…