Finding paths and deleting edges in directed acyclic graphs
- 13 May 1988
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 28 (1) , 5-11
- https://doi.org/10.1016/0020-0190(88)90136-6
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- 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
- Amortized Computational ComplexitySIAM Journal on Algebraic Discrete Methods, 1985
- Worst-case Analysis of Set Union AlgorithmsJournal of the ACM, 1984
- 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