Pages that link to "Item:Q5899451"
From MaRDI portal
The following pages link to Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths (Q5899451):
Displaying 15 items.
- Determining operations affected by delay in predictive train timetables (Q336779) (← links)
- On dynamic shortest paths problems (Q639278) (← links)
- Single-source shortest paths and strong connectivity in dynamic planar graphs (Q2051854) (← links)
- Randomization for Efficient Dynamic Graph Algorithms (Q2795930) (← links)
- Maintaining shortest paths under deletions in weighted directed graphs (Q2805514) (← links)
- Dynamic approximate all-pairs shortest paths: breaking the \(O(mn)\) barrier and derandomization (Q2816298) (← links)
- Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality (Q2942677) (← links)
- (Q4553236) (← links)
- (Q4607877) (← links)
- A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths (Q4997313) (← links)
- Dynamic matching: reducing integral algorithms to approximately-maximal fractional algorithms (Q5002673) (← links)
- Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic Time (Q5002715) (← links)
- Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs (Q5075810) (← links)
- (Q5365129) (← links)
- Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. (Q5874499) (← links)