The following pages link to (Q4471323):
Displaying 16 items.
- Fast dynamic transitive closure with lookahead (Q848959) (← links)
- Dynamic shortest paths and transitive closure: algorithmic techniques and data structures (Q849628) (← links)
- Mantaining dynamic matrices for fully dynamic transitive closure (Q930605) (← links)
- Dynamic connectivity for axis-parallel rectangles (Q1016519) (← links)
- The dynamic complexity of transitive closure is in DynTC\(^{0}\). (Q1401284) (← links)
- Efficient computation of transitive closures (Q2639033) (← links)
- A fully dynamic reachability algorithm for directed graphs with an almost linear update time (Q2810272) (← links)
- Associative version of Italiano's incremental algorithm for dynamic updating the transitive closure (Q2882988) (← links)
- Cache-Friendly implementations of transitive closure (Q3507763) (← links)
- Trade-offs for fully dynamic transitive closure on DAGs: breaking through the <i>O</i> ( <i>n</i> <sup>2</sup> barrier (Q3546293) (← links)
- On certificates and lookahead in dynamic graph problems (Q4875189) (← links)
- A faster and simpler fully dynamic transitive closure (Q4962698) (← links)
- Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time (Q5020731) (← links)
- A fully dynamic algorithm for maintaining the transitive closure (Q5917499) (← links)
- Fully Dynamic Transitive Closure in plane dags with one source and one sink (Q6102301) (← links)
- Faster fully dynamic transitive closure in practice (Q6487607) (← links)