Decremental all-pairs shortest paths in deterministic near-linear time
From MaRDI portal
Publication:6087032
DOI10.1145/3406325.3451025arXiv2109.05621OpenAlexW3170339516MaRDI QIDQ6087032
Publication date: 14 November 2023
Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.05621
This page was built for publication: Decremental all-pairs shortest paths in deterministic near-linear time
