Subquadratic dynamic path reporting in directed graphs against an adaptive adversary-Reference-Cited by-同舟云学术

Subquadratic dynamic path reporting in directed graphs against an adaptive adversary

Published:2022-06-09 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Karczmarz Adam¹,Mukherjee Anish¹,Sankowski Piotr¹

Affiliation:

1. University of Warsaw, Poland / IDEAS NCBR, Poland

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3519935.3520058

Reference42 articles.

2. Witnesses for Boolean matrix multiplication and for shortest paths

3. Incremental algorithms for minimal length paths

4. A New Approach to Incremental Cycle Detection and Related Problems

5. Thiago Bergamaschi , Monika Henzinger , Maximilian Probst Gutenberg , Virginia Vassilevska Williams, and Nicole Wein. 2020 . New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners. CoRR , abs/2010.10134 (2020), arXiv:2010.10134. arxiv:2010.10134v3 Thiago Bergamaschi, Monika Henzinger, Maximilian Probst Gutenberg, Virginia Vassilevska Williams, and Nicole Wein. 2020. New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners. CoRR, abs/2010.10134 (2020), arXiv:2010.10134. arxiv:2010.10134v3

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Deterministic Fully Dynamic SSSP and More;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

2. Approximating Edit Distance in the Fully Dynamic Model;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

3. Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

4. Fast Deterministic Fully Dynamic Distance Approximation;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10