scientific article; zbMATH DE number 7236428
From MaRDI portal
Publication:5115792
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Recommendations
- Approximate shortest paths and distance oracles in weighted unit-disk graphs
- Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs.
- Near-optimal algorithms for shortest paths in weighted unit-disk graphs
- Approximate shortest paths in weighted graphs
- Approximate distance oracles for unweighted graphs in expected \(O(n^2)\) time
- scientific article; zbMATH DE number 6469155
- An optimal algorithm for \(L_1\) shortest paths in unit-disk graphs
- Approximate Distance Queries in Disk Graphs
- Graph-Theoretic Concepts in Computer Science
- scientific article; zbMATH DE number 2119744
Cites work
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
- All pairs shortest paths using bridging sets and rectangular matrix multiplication
- Approximating geometric bottleneck shortest paths
- Approximating the Diameter of Planar Graphs in Near Linear Time
- Better tradeoffs for exact distance oracles in planar graphs
- Compact and low delay routing labeling scheme for unit disk graphs
- Compact oracles for reachability and approximate distances in planar digraphs
- Constant query time \((1+\epsilon)\)-approximate distance oracle for planar graphs
- Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications
- Faster Approximate Diameter and Distance Oracles in Planar Graphs
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 741006 (Why is no real title available?)
- scientific article; zbMATH DE number 6861957 (Why is no real title available?)
- scientific article; zbMATH DE number 2119743 (Why is no real title available?)
- Improved sparse covers for graphs excluding a fixed minor
- Many distances in planar graphs
- More compact oracles for approximate distances in undirected planar graphs
- Multiplying matrices faster than coppersmith-winograd
- On bounded leg shortest paths problems
- Planar spanners and approximate shortest path queries among obstacles in the plane
- Powers of tensors and fast matrix multiplication
- Shortest paths in intersection graphs of unit disks
- Subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphs
- Voronoi diagrams on planar graphs, and computing the diameter in deterministic \(\tilde{O}(n^{5/3})\) time
- Well-Separated Pair Decomposition for the Unit-Disk Graph Metric and Its Applications
Cited in
(15)- Reverse shortest path problem in weighted unit-disk graphs
- Near-optimal algorithms for shortest paths in weighted unit-disk graphs
- An optimal algorithm for \(L_1\) shortest paths in unit-disk graphs
- Well-separated pair decomposition for the unit-disk graph metric and its applications
- Front Matter, Table of Contents, Foreword, Conference Organization, Additional Reviewers, Acknowledgement of Support, Invited Talks
- Approximate shortest paths and distance oracles in weighted unit-disk graphs
- Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs.
- Approximate Distance Queries in Disk Graphs
- scientific article; zbMATH DE number 6469155 (Why is no real title available?)
- Well-Separated Pair Decomposition for the Unit-Disk Graph Metric and Its Applications
- Shortest-Path Queries in Geometric Networks
- Computing the minimum bottleneck moving spanning tree
- A clique-based separator for intersection graphs of geodesic disks in \(\mathbb{R}^2\)
- A clique-based separator for intersection graphs of geodesic disks in \(\mathbb{R}^2\)
- Reverse shortest path problem for unit-disk graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5115792)
