An experimental study of dynamic algorithms for transitive closure
From MaRDI portal
Recommendations
Cited in
(18)- An improved algorithm for transitive closure on acyclic digraphs
- Speeding up dynamic transitive closure for bounded degree graphs
- Incremental and decremental evaluation of transitive closure by first- order queries
- Efficient computation of transitive closures
- A fully dynamic reachability algorithm for directed graphs with an almost linear update time
- An optimal constraint programming approach to the open-shop problem
- Efficient implementation of the Italiano algorithms for updating the transitive closure on associative parallel processors
- scientific article; zbMATH DE number 1208713 (Why is no real title available?)
- scientific article; zbMATH DE number 2079364 (Why is no real title available?)
- A faster and simpler fully dynamic transitive closure
- Decremental strongly connected components and single-source reachability in near-linear time
- An experimental study of algorithms for fully dynamic transitive closure
- Algorithms – ESA 2005
- An efficient strongly connected components algorithm in the fault tolerant model
- Performance evaluation of algorithms for transitive closure
- Computing transitive closure on systolic arrays of fixed size
- Dynamic shortest paths and transitive closure: algorithmic techniques and data structures
- Mantaining dynamic matrices for fully dynamic transitive closure
This page was built for publication: An experimental study of dynamic algorithms for transitive closure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5269373)
