Almost optimal distance oracles for planar graphs
From MaRDI portal
Publication:5212755
DOI10.1145/3313276.3316316zbMath1433.68284arXiv1811.01551MaRDI QIDQ5212755
Panagiotis Charalampopoulos, Oren Weimann, Paweł Gawrychowski, Shay Mozes
Publication date: 30 January 2020
Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.01551
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
68P05: Data structures