DMCA
Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs (1995)
| Venue: | Proceedings, lOth International Symposium on Fundamentals of Computation Theory, LNCS 965 |
| Citations: | 2 - 0 self |
BibTeX
@INPROCEEDINGS{Djidjev95fastalgorithms,
author = {Hristo N. Djidjev and Grammati E. Pantziou and Christos D. Zaroliagis},
title = {Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs},
booktitle = {Proceedings, lOth International Symposium on Fundamentals of Computation Theory, LNCS 965},
year = {1995},
pages = {191--200}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. We present algorithms for maintaining shortest path infor-mation in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achieve continuous trade-offs be-tween 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 algo-rithms for dynamic planar digraphs. 1
