Thumbnail
Access Restriction
Subscribed

Author Holm, Jacob ♦ de Lichtenberg, Kristian ♦ Thorup, Mikkel
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2001
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword 2-edge connectivity ♦ Biconnectivity ♦ Connectivity ♦ Dynamic graph algorithms ♦ Minimum spanning tree
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 $\textit{n}$ vertices, the amortized operation costs are $O(log^{2}$ $\textit{n})$ for connectivity, $O(log^{4}$ $\textit{n})$ for minimum spanning forest, 2-edge connectivity, and $O(log^{5}$ $\textit{n})$ biconnectivity.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2001-07-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 48
Issue Number 4
Page Count 38
Starting Page 723
Ending Page 760


Open content in new tab

   Open content in new tab
Source: ACM Digital Library