Shortest path separators in unit disk graphs
From MaRDI portal
Cites work
- A separator theorem for graphs of bounded genus
- A Separator Theorem for Nonplanar Graphs
- A Separator Theorem for Planar Graphs
- A separator theorem in minor-closed classes
- All-pairs shortest paths in geometric intersection graphs
- Almost-linear ε -emulators for planar graphs
- An O( k)-approximation for directed Steiner tree in planar graphs
- Applications of a new separator theorem for string graphs
- Approximate shortest paths and distance oracles in weighted unit-disk graphs
- Approximation algorithms for maximum matchings in geometric intersection graphs
- Approximation algorithms for polynomial-expansion and low-density graphs
- Balanced line separators of unit disk graphs
- Clique-based separators for geometric intersection graphs
- Compact and low delay routing labeling scheme for unit disk graphs
- Compact oracles for reachability and approximate distances in planar digraphs
- Computing diameter+2 in truly-subquadratic time for unit-disk graphs
- Constrained Delaunay triangulations
- Detecting weakly simple polygons
- Embeddings of planar quasimetrics into directed _1 and polylogarithmic approximation for directed sparsest-cut
- Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
- Finding small simple cycle separators for 2-connected planar graphs
- Finding triangles and other small subgraphs in geometric intersection graphs
- Fixed-radius near neighbors search algorithms for points and segments
- Geometric separator theorems and applications
- scientific article; zbMATH DE number 3752239 (Why is no real title available?)
- scientific article; zbMATH DE number 2119743 (Why is no real title available?)
- NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
- Near-optimal separators in string graphs
- Object location using path separators
- Optimal approximate distance oracle for planar graphs
- Planar diameter via metric compression
- Planar separators and parallel polygon triangulation.
- Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
- Polynomial-time approximation schemes for packing and piercing fat objects
- Routing in unit disk graphs
- Separator theorems and Turán-type results for planar intersection graphs
- Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications
- Separators for sphere-packings and nearest neighbor graphs
- Separators in region intersection graphs
- Shortest non-crossing walks in the plane
- Shortest paths in intersection graphs of unit disks
- Structured recursive separator decompositions for planar graphs in linear time
- Unit disk graphs
- Well-Separated Pair Decomposition for the Unit-Disk Graph Metric and Its Applications
This page was built for publication: Shortest path separators in unit disk graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7253130)
