Improved distance sensitivity oracles via tree partitioning

DOI10.1007/978-3-319-62127-2_30zbMath1493.68267arXiv1605.04491OpenAlexW2963219186MaRDI QIDQ2405296

Tianyi Zhang, Ran Duan

Publication date: 22 September 2017

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

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 (2)

Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time. ⋮ Improved distance sensitivity oracles with subcubic preprocessing time

This page was built for publication: Improved distance sensitivity oracles via tree partitioning