Near-optimal fully-dynamic graph connectivity
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Standard
Near-optimal fully-dynamic graph connectivity. / Thorup, Mikkel.
Proceedings of the 32nd ACM Symposium on the Theory of Computing (STOC). 2000. p. 343-350.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Harvard
Thorup, M 2000, Near-optimal fully-dynamic graph connectivity. in Proceedings of the 32nd ACM Symposium on the Theory of Computing (STOC). pp. 343-350.
APA
Thorup, M. (2000). Near-optimal fully-dynamic graph connectivity. In Proceedings of the 32nd ACM Symposium on the Theory of Computing (STOC) (pp. 343-350)
Vancouver
Thorup M. Near-optimal fully-dynamic graph connectivity. In Proceedings of the 32nd ACM Symposium on the Theory of Computing (STOC). 2000. p. 343-350
Author
Bibtex
@inproceedings{5b6a8c3a5202462aa93b2a9451449943,
title = "Near-optimal fully-dynamic graph connectivity",
author = "Mikkel Thorup",
year = "2000",
language = "English",
pages = "343--350",
booktitle = "Proceedings of the 32nd ACM Symposium on the Theory of Computing (STOC)",
}
RIS
TY - GEN
T1 - Near-optimal fully-dynamic graph connectivity
AU - Thorup, Mikkel
PY - 2000
Y1 - 2000
M3 - Article in proceedings
SP - 343
EP - 350
BT - Proceedings of the 32nd ACM Symposium on the Theory of Computing (STOC)
ER -
ID: 98318174