Improved Distance Oracles and Spanners for Vertex-Labeled Graphs

DOI10.1007/978-3-642-33090-2_29zbMath1365.68176arXiv1109.3114OpenAlexW1594949237MaRDI QIDQ2912852

Shiri Chechik

Publication date: 25 September 2012

Published in: Algorithms – ESA 2012 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1109.3114

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) 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: Improved Distance Oracles and Spanners for Vertex-Labeled Graphs