Incremental algorithms for minimal length paths
- 1 December 1991
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 12 (4), 615-638
- https://doi.org/10.1016/0196-6774(91)90036-x
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A compression technique to materialize transitive closureACM Transactions on Database Systems, 1990
- Finding paths and deleting edges in directed acyclic graphsInformation Processing Letters, 1988
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- A topological approach to dynamic graph connectivityInformation Processing Letters, 1987
- Amortized efficiency of a path retrieval data structureTheoretical Computer Science, 1986
- Data Structures for On-Line Updating of Minimum Spanning Trees, with ApplicationsSIAM Journal on Computing, 1985
- A data structure for dynamic treesJournal of Computer and System Sciences, 1983
- On-line computation of transitive closures of graphsInformation Processing Letters, 1983
- An On-Line Edge-Deletion ProblemJournal of the ACM, 1981
- Algorithms for updating minimal spanning treesJournal of Computer and System Sciences, 1978