Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n 1/2

Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n 1/2 - ε )-time

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

Author:

Nanongkai Danupon¹,Saranurak Thatchaphol¹

Affiliation:

1. KTH, Sweden

Publisher

ACM

Link

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

Reference48 articles.

1. Ittai Abraham David Durfee Ioannis Koutis Sebastian Krinninger and Richard Peng. 2016. On Fully Dynamic Graph Sparsifiers. CoRR abs/1604.02094 (2016). http://arxiv.org/abs/1604.02094 Ittai Abraham David Durfee Ioannis Koutis Sebastian Krinninger and Richard Peng. 2016. On Fully Dynamic Graph Sparsifiers. CoRR abs/1604.02094 (2016). http://arxiv.org/abs/1604.02094

2. Stephen Alstrup Jacob Holm Kristian de Lichtenberg and Mikkel Thorup. 2005. Stephen Alstrup Jacob Holm Kristian de Lichtenberg and Mikkel Thorup. 2005.

3. Maintaining information in fully dynamic trees with top trees. ACM Transactions on Algorithms 1 2 (2005) 243–264. DOI:https:// 10.1145/1103963.1103966 Maintaining information in fully dynamic trees with top trees. ACM Transactions on Algorithms 1 2 (2005) 243–264. DOI:https:// 10.1145/1103963.1103966

4. On Sketching Quadratic Forms

5. Shai Ben-David Allan Borodin Richard M. Karp Gábor Tardos and Avi Wigderson. 1990. Shai Ben-David Allan Borodin Richard M. Karp Gábor Tardos and Avi Wigderson. 1990.

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

1. Expander Hierarchies for Normalized Cuts on Graphs;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24

2. Fast Computation for the Forest Matrix of an Evolving Graph;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24

3. A Simpler and Parallelizable O(√log n)-approximation Algorithm for Sparsest Cut;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17

4. Approximating Small Sparse Cuts;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

5. Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10