Speeding up dynamic transitive closure for bounded degree graphs
- 1 April 1993
- journal article
- research article
- Published by Springer Nature in Acta Informatica
- Vol. 30 (4) , 369-384
- https://doi.org/10.1007/bf01209711
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- INCACM Transactions on Programming Languages and Systems, 1991
- Making data structures persistentJournal of Computer and System Sciences, 1989
- Dynamic data structures for series parallel digraphsPublished by Springer Nature ,1989
- Finding paths and deleting edges in directed acyclic graphsInformation Processing Letters, 1988
- Maintenance of transitive closures and transitive reductions of graphsLecture Notes in Computer Science, 1988
- Fully dynamic techniques for point location and transitive closure in planar structuresPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Amortized efficiency of a path retrieval data structureTheoretical Computer Science, 1986
- On-line computation of transitive closures of graphsInformation Processing Letters, 1983
- Data Structures and Network AlgorithmsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1983