A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs
- 1 January 1993
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A parallel randomized approximation scheme for shortest pathsPublished by Association for Computing Machinery (ACM) ,1992
- Incremental algorithms for minimal length pathsJournal of Algorithms, 1991
- Maintaining biconnected components of dynamic planar graphsPublished by Springer Nature ,1991
- Computing shortest paths and distances in planar graphsPublished by Springer Nature ,1991
- Fast Algorithms for Shortest Paths in Planar Graphs, with ApplicationsSIAM Journal on Computing, 1987
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- Finding small simple cycle separators for 2-connected planar graphsJournal of Computer and System Sciences, 1986
- Data Structures for On-Line Updating of Minimum Spanning Trees, with ApplicationsSIAM Journal on Computing, 1985
- A Separator Theorem for Planar GraphsSIAM Journal on Applied Mathematics, 1979
- A note on two problems in connexion with graphsNumerische Mathematik, 1959