Affiliation:
1. University of Copenhagen, Copenhagen, Denmark
2. AT&T Labs---Research, Florham Park, New Jersey
Abstract
Deterministic fully dynamic graph algorithms are presented for connectivity, minimum spanning tree, 2-edge connectivity, and biconnectivity. Assuming that we start with no edges in a graph with
n
vertices, the amortized operation costs are
O
(log
2
n
) for connectivity,
O
(log
4
n
) for minimum spanning forest, 2-edge connectivity, and
O
(log
5
n
) biconnectivity.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
269 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. 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
2. A Graph Multi-separator Problem for Image Segmentation;Journal of Mathematical Imaging and Vision;2024-08-12
3. Good r-divisions Imply Optimal Amortized Decremental Biconnectivity;Theory of Computing Systems;2024-06-27
4. Parallel Dynamic Maximal Matching;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17
5. Deterministic and Low-Span Work-Efficient Parallel Batch-Dynamic Trees;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17