An Experimental Study of Poly-Logarithmic Fully-Dynamic Connectivity Algorithms
Research output: Contribution to journal › Journal article › Research › peer-review
Standard
An Experimental Study of Poly-Logarithmic Fully-Dynamic Connectivity Algorithms. / Iyer, Raj D.; Karger, David; Rahul, Hariharan S.; Thorup, Mikkel.
In: ACM Journal of Experimental Algorithmics, Vol. 6, 2001, p. Article 4.Research output: Contribution to journal › Journal article › Research › peer-review
Harvard
Iyer, RD, Karger, D, Rahul, HS & Thorup, M 2001, 'An Experimental Study of Poly-Logarithmic Fully-Dynamic Connectivity Algorithms', ACM Journal of Experimental Algorithmics, vol. 6, pp. Article 4.
APA
Iyer, R. D., Karger, D., Rahul, H. S., & Thorup, M. (2001). An Experimental Study of Poly-Logarithmic Fully-Dynamic Connectivity Algorithms. ACM Journal of Experimental Algorithmics, 6, Article 4.
Vancouver
Iyer RD, Karger D, Rahul HS, Thorup M. An Experimental Study of Poly-Logarithmic Fully-Dynamic Connectivity Algorithms. ACM Journal of Experimental Algorithmics. 2001;6: Article 4.
Author
Bibtex
@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",
}
RIS
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
VL - 6
SP - Article 4
JO - A C M Journal of Experimental Algorithmics
JF - A C M Journal of Experimental Algorithmics
SN - 1084-6654
ER -
ID: 98317525