Pages that link to "Item:Q4575632"
From MaRDI portal
The following pages link to On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs (Q4575632):
Displaying 6 items.
- Single-source shortest paths and strong connectivity in dynamic planar graphs (Q2051854) (← links)
- Dynamic matching: reducing integral algorithms to approximately-maximal fractional algorithms (Q5002673) (← links)
- As Time Goes By: Reflections on Treewidth for Temporal Graphs (Q5042450) (← links)
- (Q5091049) (← links)
- Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. (Q5874499) (← links)
- Efficient dynamic approximate distance oracles for vertex-labeled planar graphs (Q5915659) (← links)