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
259 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献