A fully dynamic approximation scheme for shortest paths in planar graphs
From MaRDI portal
Recommendations
Cited in
(22)- Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs
- Single-source shortest paths and strong connectivity in dynamic planar graphs
- Distributed distance computation and routing with small messages
- A survey on combinatorial optimization in dynamic environments
- DMVP: Foremost Waypoint Coverage of Time-Varying Graphs
- On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs
- scientific article; zbMATH DE number 6850313 (Why is no real title available?)
- scientific article; zbMATH DE number 219245 (Why is no real title available?)
- Dynamic approximate vertex cover and maximum matching
- Dynamic effective resistances and approximate Schur complement on separable graphs
- A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs
- The power of vertex sparsifiers in dynamic graph algorithms
- Shortest-path queries in static networks
- Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time
- A fully dynamic algorithm for planar
- Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
- Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs.
- Certifying fully dynamic algorithms for recognition and Hamiltonicity of threshold and chain graphs
- Dynamic algorithms for shortest paths in planar graphs
- Fully dynamic strongly connected components in planar digraphs
- Fine-grained complexity lower bounds for families of dynamic graphs
- Cut-preserving vertex sparsifiers for planar and quasi-bipartite graphs
This page was built for publication: A fully dynamic approximation scheme for shortest paths in planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1273930)
