Approximate Nearest Neighbor Search in Metrics of Planar Graphs

From MaRDI portal

Revision as of 00:04, 9 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5351887

Jump to:navigation, search

DOI10.4230/LIPIcs.APPROX-RANDOM.2015.20zbMath1375.68043OpenAlexW2285192099MaRDI QIDQ5351887

Shiri Chechik, Ittai Abraham, Udi Wieder, Robert Krauthgamer

Publication date: 31 August 2017

Full work available at URL: http://dx.doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.20

zbMATH Keywords

planar graphs data structures nearest neighbor search planar separator planar metrics

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (4)

Metric Embedding via Shortest Path Decompositions ⋮ The nearest colored node in a tree ⋮ Succinct data structures for nearest colored node in a tree ⋮ Efficient vertex-label distance oracles for planar graphs

This page was built for publication: Approximate Nearest Neighbor Search in Metrics of Planar Graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5351887&oldid=20057321"