On the structure of DFS-forests on directed graphs and the dynamic maintenance of DFS on DAG's
- 1 January 1994
- book chapter
- Published by Springer Nature
- p. 343-353
- https://doi.org/10.1007/bfb0049421
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Faster shortest-path algorithms for planar graphsPublished by Association for Computing Machinery (ACM) ,1994
- Fully dynamic planarity testing (extended abstract)Published by Association for Computing Machinery (ACM) ,1992
- Sparsification-a technique for speeding up dynamic graph algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Incremental algorithms for minimal length pathsJournal of Algorithms, 1991
- Finding paths and deleting edges in directed acyclic graphsInformation Processing Letters, 1988
- A topological approach to dynamic graph connectivityInformation Processing Letters, 1987
- Amortized efficiency of a path retrieval data structureTheoretical Computer Science, 1986
- Depth-first search is inherently sequentialInformation Processing Letters, 1985
- Algorithm 447: efficient algorithms for graph manipulationCommunications of the ACM, 1973
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972