scientific article; zbMATH DE number 2079364
From MaRDI portal
Publication:4471323
Recommendations
- A faster and simpler fully dynamic transitive closure
- Faster fully dynamic transitive closure in practice
- Fast dynamic transitive closure with lookahead
- A fully dynamic algorithm for maintaining the transitive closure
- A fully dynamic algorithm for maintaining the transitive closure
- Efficient computation of transitive closures
- An experimental study of algorithms for fully dynamic transitive closure
- Algorithms – ESA 2005
- An experimental study of dynamic algorithms for transitive closure
- Cache-Friendly implementations of transitive closure
Cited in
(26)- Dynamic connectivity for axis-parallel rectangles
- The dynamic complexity of transitive closure is in DynTC\(^{0}\).
- Efficient computation of transitive closures
- A fully dynamic reachability algorithm for directed graphs with an almost linear update time
- Associative version of Italiano's incremental algorithm for dynamic updating the transitive closure
- Reachability in graph timelines
- Cache-Friendly implementations of transitive closure
- Dynamic Plane Transitive Closure
- Improved Dynamic Reachability Algorithms for Directed Graphs
- Trade-offs for fully dynamic transitive closure on DAGs: breaking through the O ( n 2 barrier
- A fully dynamic reachability algorithm for directed graphs with an almost linear update time
- Efficient implementation of the Italiano algorithms for updating the transitive closure on associative parallel processors
- scientific article; zbMATH DE number 4083002 (Why is no real title available?)
- scientific article; zbMATH DE number 2080476 (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
- An experimental study of dynamic algorithms for transitive closure
- Algorithms – ESA 2005
- A fully dynamic algorithm for maintaining the transitive closure
- A fully dynamic algorithm for maintaining the transitive closure
- Fully Dynamic Transitive Closure in plane dags with one source and one sink
- Faster fully dynamic transitive closure in practice
- Fast dynamic transitive closure with lookahead
- 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:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471323)
