Faster Shortest-Path Algorithms for Planar Graphs

This publication has 27 references indexed in Scilit:

• Trans-dichotomous algorithms for minimum spanning trees and shortest paths
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• An Optimal Algorithm for Selection in a Min-Heap
  Information and Computation, 1993
• Efficient parallel shortest-paths in digraphs with a separator decomposition
  Published by Association for Computing Machinery (ACM) ,1993
• Maintaining biconnected components of dynamic planar graphs
  Published by Springer Nature ,1991
• A separator theorem for nonplanar graphs
  Journal of the American Mathematical Society, 1990
• Faster algorithms for the shortest path problem
  Journal of the ACM, 1990
• Almost-optimum speed-ups of algorithms for bipartite matching and related problems
  Published by Association for Computing Machinery (ACM) ,1988
• Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
  SIAM Journal on Computing, 1987
• Fibonacci heaps and their uses in improved network optimization algorithms
  Journal of the ACM, 1987
• Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
  SIAM Journal on Computing, 1985