Pages that link to "Item:Q3546293"
From MaRDI portal
The following pages link to Trade-offs for fully dynamic transitive closure on DAGs: breaking through the <i>O</i> ( <i>n</i> <sup>2</sup> barrier (Q3546293):
Displaying 8 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)
- Speeding up dynamic transitive closure for bounded degree graphs (Q1323330) (← links)
- A fully dynamic reachability algorithm for directed graphs with an almost linear update time (Q2810272) (← links)
- Tight bounds for the performance of Longest In System on DAGs (Q3022748) (← links)
- Fully Dynamic Transitive Closure in plane dags with one source and one sink (Q6102301) (← links)