An Experimental Study of Poly-Logarithmic Fully-Dynamic Connectivity Algorithms

Raj D. Iyer, David Karger, Hariharan S. Rahul, Mikkel Thorup

15 Citations (Scopus)

Translated title of the contribution	An Experimental Study of Poly-Logarithmic Fully-Dynamic Connectivity Algorithms
Original language	English
Journal	ACM Journal of Experimental Algorithmics
Volume	6
Pages (from-to)	Article 4
ISSN	1084-6654
Publication status	Published - 2001
Externally published	Yes

Cite this

@article{c52a0e145f9041468df7aebbba63e362,

title = "An Experimental Study of Poly-Logarithmic Fully-Dynamic Connectivity Algorithms",

author = "Iyer, {Raj D.} and David Karger and Rahul, {Hariharan S.} and Mikkel Thorup",

note = "Announced at ALENEX'00",

year = "2001",

language = "English",

volume = "6",

pages = " Article 4",

journal = "A C M Journal of Experimental Algorithmics",

issn = "1084-6654",

publisher = "Association for Computing Machinery",

}

TY - JOUR

T1 - An Experimental Study of Poly-Logarithmic Fully-Dynamic Connectivity Algorithms

AU - Iyer, Raj D.

AU - Karger, David

AU - Rahul, Hariharan S.

AU - Thorup, Mikkel

N1 - Announced at ALENEX'00

PY - 2001

Y1 - 2001

M3 - Journal article

SN - 1084-6654

VL - 6

SP - Article 4

JO - A C M Journal of Experimental Algorithmics

JF - A C M Journal of Experimental Algorithmics

ER -