Pages that link to "Item:Q930605"
From MaRDI portal
The following pages link to Mantaining dynamic matrices for fully dynamic transitive closure (Q930605):
Displaying 8 items.
- Fast dynamic transitive closure with lookahead (Q848959) (← links)
- The dynamic complexity of transitive closure is in DynTC\(^{0}\). (Q1401284) (← links)
- Dynamic matrix rank with partial lookahead (Q2254496) (← links)
- Dynamic matrix rank with partial lookahead (Q3165965) (← 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)
- Decremental SPQR-trees for Planar Graphs (Q5009609) (← links)
- Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier (Q5232328) (← links)
- A fully dynamic algorithm for maintaining the transitive closure (Q5917499) (← links)