Pages that link to "Item:Q4575765"
From MaRDI portal
The following pages link to Fully dynamic all-pairs shortest paths with worst-case update-time revisited (Q4575765):
Displaying 11 items.
- Average update times for fully-dynamic all-pairs shortest paths (Q643013) (← links)
- Single-source shortest paths and strong connectivity in dynamic planar graphs (Q2051854) (← links)
- On the robustness of the metric dimension of grid graphs to adding a single edge (Q2143039) (← links)
- A new approach to dynamic all pairs shortest paths (Q3581293) (← links)
- Dynamic matching: reducing integral algorithms to approximately-maximal fractional algorithms (Q5002673) (← links)
- Improved Dynamic Graph Coloring (Q5009642) (← links)
- Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs (Q5075810) (← links)
- Fully Dynamic Connectivity Oracles under General Vertex Updates (Q5136280) (← links)
- Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds (Q5146947) (← links)
- Algorithm Theory - SWAT 2004 (Q5315390) (← links)
- Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. (Q5874499) (← links)