Fully dynamic shortest paths in digraphs with arbitrary arc weights
- 31 October 2003
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 49 (1), 86-113
- https://doi.org/10.1016/s0196-6774(03)00082-8
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Semi-dynamic breadth-first search in digraphsTheoretical Computer Science, 2001
- Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential AlgorithmsAlgorithmica, 2000
- Fully Dynamic Algorithms for Maintaining Shortest Paths TreesJournal of Algorithms, 2000
- Semidynamic Algorithms for Maintaining Single-Source Shortest Path TreesAlgorithmica, 1998
- Experimental analysis of dynamic algorithms for the single source shortest paths problemACM Journal of Experimental Algorithmics, 1998
- Faster Shortest-Path Algorithms for Planar GraphsJournal of Computer and System Sciences, 1997
- On the computational complexity of dynamic graph problemsTheoretical Computer Science, 1996
- Incremental algorithms for minimal length pathsJournal of Algorithms, 1991
- Planar orientations with low out-degree and compaction of adjacency matricesTheoretical Computer Science, 1991
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972