A fully dynamic algorithm for maintaining the transitive closure
Authors:
Open Access
- 1 May 1999
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 492-498
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity1998
- Sampling to provide or to bound: With applications to fully dynamic graph algorithmsRandom Structures & Algorithms, 1997
- Size-Estimation Framework with Applications to Transitive Closure and ReachabilityJournal of Computer and System Sciences, 1997
- Speeding up dynamic transitive closure for bounded degree graphsActa Informatica, 1993
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- Finding paths and deleting edges in directed acyclic graphsInformation Processing Letters, 1988
- On-line computation of transitive closures of graphsInformation Processing Letters, 1983
- An On-Line Edge-Deletion ProblemJournal of the ACM, 1981
- Gaussian elimination is not optimalNumerische Mathematik, 1969