Well-separated pair decomposition for the unit-disk graph metric and its applications

DOI10.1145/780542.780613zbMath1192.05038OpenAlexW2031256962MaRDI QIDQ3581305

No author found.

Publication date: 16 August 2010

Published in: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://authors.library.caltech.edu/1370/

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Medial Axis Based Routing Has Constant Load Balancing Factor ⋮ Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs ⋮ Compact and low delay routing labeling scheme for unit disk graphs ⋮ Shortest-Path Queries in Geometric Networks

This page was built for publication: Well-separated pair decomposition for the unit-disk graph metric and its applications