Distance Oracles for Vertex-Labeled Graphs
From MaRDI portal
Publication:3012943
DOI10.1007/978-3-642-22012-8_39zbMath1333.68212OpenAlexW2229164416MaRDI QIDQ3012943
Danny Hermelin, Raphael Yuster, Oren Weimann, Avivit Levy
Publication date: 7 July 2011
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22012-8_39
Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) 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
Cites Work
- On the distortion required for embedding finite metric spaces into normed spaces
- Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
- Approximate distance oracles
- Design and implementation of an efficient priority queue
- Distance Oracles for Sparse Graphs
- Distance Oracles beyond the Thorup--Zwick Bound
- Automata, Languages and Programming
This page was built for publication: Distance Oracles for Vertex-Labeled Graphs
