Sciweavers

Share
FCT
1995
Springer

Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs

9 years 6 months ago
Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs
Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achieve continuous trade-offs between the preprocessing, query, and update times. Our data structure is based on a recursive separator decomposition of the graph and it encodes the shortest paths between the members of a properly chosen subset of vertices. We apply this result to construct improved shortest path algorithms for dynamic planar digraphs.
Hristo Djidjev, Grammati E. Pantziou, Christos D.
Added 26 Aug 2010
Updated 26 Aug 2010
Type Conference
Year 1995
Where FCT
Authors Hristo Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis
Comments (0)
books