Maintaining exact distances under multiple edge failures

DOI10.1145/3519935.3520002arXiv2111.03360OpenAlexW3211891880MaRDI QIDQ6083561

Ran Duan, Hanlin Ren

Publication date: 8 December 2023

Published in: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

shortest pathsdynamic data structuresdistance sensitivity oracles

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Compact distance oracles with large sensitivity and low stretch

This page was built for publication: Maintaining exact distances under multiple edge failures