Faster Shortest-Path Algorithms for Planar Graphs
Open Access
- 1 August 1997
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 55 (1), 3-23
- https://doi.org/10.1006/jcss.1997.1493
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- Trans-dichotomous algorithms for minimum spanning trees and shortest pathsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An Optimal Algorithm for Selection in a Min-HeapInformation and Computation, 1993
- Efficient parallel shortest-paths in digraphs with a separator decompositionPublished by Association for Computing Machinery (ACM) ,1993
- Maintaining biconnected components of dynamic planar graphsLecture Notes in Computer Science, 1991
- A separator theorem for nonplanar graphsJournal of the American Mathematical Society, 1990
- Faster algorithms for the shortest path problemJournal of the ACM, 1990
- Almost-optimum speed-ups of algorithms for bipartite matching and related problemsPublished by Association for Computing Machinery (ACM) ,1988
- 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
- Data Structures for On-Line Updating of Minimum Spanning Trees, with ApplicationsSIAM Journal on Computing, 1985