Pages that link to "Item:Q5917499"
From MaRDI portal
The following pages link to A fully dynamic algorithm for maintaining the transitive closure (Q5917499):
Displaying 15 items.
- Computing transitive closure on systolic arrays of fixed size (Q808290) (← links)
- 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)
- Maintaining dynamic minimum spanning trees: an experimental study (Q968158) (← links)
- Dynamic connectivity for axis-parallel rectangles (Q1016519) (← links)
- An improved algorithm for transitive closure on acyclic digraphs (Q1110330) (← links)
- The dynamic complexity of transitive closure is in DynTC\(^{0}\). (Q1401284) (← links)
- Randomization for Efficient Dynamic Graph Algorithms (Q2795930) (← links)
- A game theoretic approach to the analysis of dynamic networks (Q2864354) (← links)
- Associative version of Italiano's incremental algorithm for dynamic updating the transitive closure (Q2882988) (← 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)
- (Q4471323) (← links)
- A faster and simpler fully dynamic transitive closure (Q4962698) (← links)
- Strong Connectivity in Directed Graphs under Failures, with Applications (Q5123984) (← links)