Access Restriction

Author Iyer, Raj ♦ Karger, David ♦ Rahul, Hariharan ♦ 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 ♦ Computer programming, programs & data
Abstract We present an experimental study of different variants of theamortized $O(log^{2}$ $\textit{n})-time$ fully-dynamicconnectivity algorithm of Holm, de Lichtenberg, and Thorup(STOC'98). The experiments build upon experiments provided byAlberts, Cattaneo, and Italiano (SODA'96) on the randomizedamortized $O(log^{3}$ $\textit{n})$ fully-dynamicconnectivity algorithm of Henzinger and King (STOC'95). Ourexperiments shed light upon similarities and differences betweenthe two algorithms. We also present a slightly modified version ofthe Henzinger-King algorithm that runs in $O(log^{2}n)$ time, which resulted from our experiments.
ISSN 10846654
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2001-12-01
Publisher Place New York
e-ISSN 10846654
Journal Journal of Experimental Algorithmics (JEA)
Volume Number 6

Open content in new tab

   Open content in new tab
Source: ACM Digital Library