Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
- 1 December 1987
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 16 (6) , 1004-1022
- https://doi.org/10.1137/0216064
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Data Structures for On-Line Updating of Minimum Spanning Trees, with ApplicationsSIAM Journal on Computing, 1985
- An $O(n\log ^2 n)$ Algorithm for Maximum Flow in Undirected Planar NetworksSIAM Journal on Computing, 1985
- On multicommodity flows in planar graphsNetworks, 1984
- Shortest‐path algorithms: Taxonomy and annotationNetworks, 1984
- Maximum flow in (s,t) planar networksInformation Processing Letters, 1981
- Maximum Flow in Planar NetworksSIAM Journal on Computing, 1979
- Generalized Nested DissectionSIAM Journal on Numerical Analysis, 1979
- Efficient Algorithms for Shortest Paths in Sparse NetworksJournal of the ACM, 1977
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- A note on two problems in connexion with graphsNumerische Mathematik, 1959