Pages that link to "Item:Q3448830"
From MaRDI portal
The following pages link to Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs (Q3448830):
Displaying 8 items.
- An efficient strongly connected components algorithm in the fault tolerant model (Q666658) (← links)
- A fully dynamic reachability algorithm for directed graphs with an almost linear update time (Q2810272) (← links)
- Decremental single-source reachability in planar digraphs (Q4978051) (← links)
- Dynamic matching: reducing integral algorithms to approximately-maximal fractional algorithms (Q5002673) (← links)
- Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time (Q5020731) (← links)
- Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs (Q5075810) (← links)
- Fully Dynamic Single-Source Reachability in Practice: An Experimental Study (Q5147502) (← links)
- Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths (Q5899451) (← links)