Improved distance queries in planar graphs

Details Improved distance queries in planar graphs Improved distance queries in planar graphs

2010-12-13

arxiv.org/abs/1012.2825v2

Computer Science

Data Structures and Algorithms

Scientific paper

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^(4/3)) or higher while matching the best known query time. The third data structure improves the query time for a similar range of space bounds, at the expense of a longer preprocessing time. The techniques that we use include modifying the parameters of planar graph decompositions, combining the different advantages of existing data structures, and using the Monge property for finding minimum elements of matrices.

Affiliated with

Also associated with

No associations

Rating

Improved distance queries in planar graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Improved distance queries in planar graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improved distance queries in planar graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-27836