Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
Top Cited Papers
- 1 February 2000
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 34 (2) , 251-281
- https://doi.org/10.1006/jagm.1999.1048
Abstract
No abstract availableThis publication has 25 references indexed in Scilit:
- Semi-dynamic shortest paths and breadth-first search in digraphsPublished by Springer Nature ,1997
- Shortest path queries in digraphs of small treewidthPublished by Springer Nature ,1995
- Dynamic algorithms for shortest paths in planar graphsTheoretical Computer Science, 1993
- Incremental algorithms for minimal length pathsJournal of Algorithms, 1991
- Planar orientations with low out-degree and compaction of adjacency matricesTheoretical Computer Science, 1991
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 1985
- Lehmans switching game and a theorem of Tutte and Nash-WilliamsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Minimum partition of a matroid into independent subsetsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- A note on two problems in connexion with graphsNumerische Mathematik, 1959