(1 + ε)-Distance Oracles for Vertex-Labeled Planar Graphs

DOI10.1007/978-3-642-38236-9_5zbMath1382.68174OpenAlexW63325702MaRDI QIDQ4922113

Mingfei Li, Chu Chung Christopher Ma, Li Ning

Publication date: 28 May 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38236-9_5

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Data structures (68P05)

Related Items (4)

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 ⋮ Efficient dynamic approximate distance oracles for vertex-labeled planar graphs

This page was built for publication: (1 + ε)-Distance Oracles for Vertex-Labeled Planar Graphs