Many distances in planar graphs
From MaRDI portal
Many distances in planar graphs (scientific article; zbMATH DE number 6028414)
Recommendations
- Distances and cuts in planar graphs
- Geodesic distance in planar graphs
- On distance in some finite planes and graphs arising from those planes
- Distances in a rigid unit-distance graph in the plane
- Distinct distances in finite planar sets
- On some distance-regular graphs with many vertices
- Small unit-distance graphs in the plane
- On large distances in planar sets
- On distance between graphs
- scientific article; zbMATH DE number 6000737
Cites work
- scientific article; zbMATH DE number 5506235 (Why is no real title available?)
- scientific article; zbMATH DE number 1875406 (Why is no real title available?)
- scientific article; zbMATH DE number 2119744 (Why is no real title available?)
- scientific article; zbMATH DE number 1424297 (Why is no real title available?)
- A Separator Theorem for Planar Graphs
- All-pairs shortest paths with real weights in \(O ( n^{3}/\log n )\) time
- Approximating the Stretch Factor of Euclidean Graphs
- Compact oracles for reachability and approximate distances in planar digraphs
- Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
- Faster shortest-path algorithms for planar graphs
- Finding small simple cycle separators for 2-connected planar graphs
- Generalized Nested Dissection
- Many distances in planar graphs
- Multiple source shortest paths in a genus g graph
- Multiple-source shortest paths in planar graphs
- Planar graph decomposition and all pairs shortest paths
- Planar graphs, negative weight edges, shortest paths, and near linear time
- Planar separators and parallel polygon triangulation.
- Planar spanners and approximate shortest path queries among obstacles in the plane
- Short path queries in planar graphs in constant time
- Shortest path queries in planar graphs
- Shortest paths in directed planar graphs with negative lengths: a linear-space \(O(n\log^{2} n)\)-time algorithm
- Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation
- The design of dynamic data structures
Cited in
(17)- scientific article; zbMATH DE number 7561410 (Why is no real title available?)
- Faster shortest paths in dense distance graphs, with applications
- A substring-substring LCS data structure
- Subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphs
- Subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphs
- Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs.
- Near-optimal distance emulator for planar graphs
- Almost optimal exact distance oracles for planar graphs
- scientific article; zbMATH DE number 7561636 (Why is no real title available?)
- Shortest-path queries in static networks
- Single-source shortest paths and strong connectivity in dynamic planar graphs
- Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time
- Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
- Short and simple cycle separators in planar graphs
- scientific article; zbMATH DE number 7236428 (Why is no real title available?)
- Distances and cuts in planar graphs
- Non-crossing shortest paths in undirected unweighted planar graphs in linear time
This page was built for publication: Many distances in planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5920250)
