Dynamic algorithms for shortest paths in planar graphs (original) (raw)
Related papers
Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs
Lecture Notes in Computer Science, 1995
Improved Algorithms for Dynamic Shortest Paths
Algorithmica, 2000
Planar Graphs, Negative Weight Edges, Shortest Paths, Near Linear Time
2001
Maximum flows and parametric shortest paths in planar graphs
Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms
Algorithmica, 2000
An external memory data structure for shortest path queries
Discrete Applied Mathematics, 2003
On-line and dynamic algorithms for shortest path problems
Lecture Notes in Computer Science, 1995
Shortest path queries in digraphs of small treewidth
Lecture Notes in Computer Science, 1995
Computing All-Pairs Shortest Paths by Leveraging Low Treewidth (extended abstract)
2011
Fully dynamic algorithms for maintaining shortest paths trees
Journal of Algorithms, 2000
Fully dynamic all pairs shortest paths with real edge weights
2001
A new algorithm to find the shortest paths between all pairs of nodes
Discrete Applied Mathematics, 1982
Fully dynamic shortest paths in digraphs with arbitrary arc weights
Journal of Algorithms, 2003
A new approach to dynamic all pairs shortest paths
2004
Efficient parallel algorithms for shortest paths in planar digraphs
BIT, 1992
Incremental algorithms for minimal length paths
Giorgio Ausiello, Umberto Nanni
Journal of Algorithms, 1991
Data structures for two-edge connectivity in planar graphs
Theoretical Computer Science, 1994
Shortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms
Theoretical Computer Science, 1998
Maximum st-Flow in Directed Planar Graphs via Shortest Paths
Lecture Notes in Computer Science, 2013
Computing all-pairs shortest paths by leveraging low treewidth
2012
Improved bounds and new trade-offs for dynamic all pairs shortest paths
2002
Maintaining shortest paths in digraphs with arbitrary arc weights: An experimental study
Algorithm …, 2001
On-line computation of minimal and maximal length paths
Theoretical Computer …, 1992