Dynamic algorithms for shortest paths in planar graphs
- 16 August 1993
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 116 (2) , 359-371
- https://doi.org/10.1016/0304-3975(93)90328-q
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Incremental algorithms for minimal length pathsJournal of Algorithms, 1991
- Computing shortest paths and distances in planar graphsPublished by Springer Nature ,1991
- Incremental planarity testingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Incremental data flow analysis via dominator and attribute updatePublished by Association for Computing Machinery (ACM) ,1988
- Fast Algorithms for Shortest Paths in Planar Graphs, with ApplicationsSIAM Journal on Computing, 1987
- Maximum flow in (s,t) planar networksInformation Processing Letters, 1981
- A Separator Theorem for Planar GraphsSIAM Journal on Applied Mathematics, 1979
- A note on two problems in connexion with graphsNumerische Mathematik, 1959