Preprocess, Set, Query!

DOI10.1007/978-3-642-23719-5_51zbMath1307.68093OpenAlexW2168839401MaRDI QIDQ3092264

Liam Roditty, Ely Porat

Publication date: 16 September 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-23719-5_51

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)

Related Items (2)

Distance oracles for time-dependent networks ⋮ An axiomatic approach to time-dependent shortest path oracles

This page was built for publication: Preprocess, Set, Query!