Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge and biconnectivity

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Standard

Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge and biconnectivity. / Holm, Jacob; de Lichtenberg, Kristian; Thorup, Mikkel.

Proceedings of the 30th ACM Symposium on the Theory of Computing (STOC). ACM, 1998. p. 79-89.

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Harvard

Holm, J, de Lichtenberg, K & Thorup, M 1998, Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge and biconnectivity. in Proceedings of the 30th ACM Symposium on the Theory of Computing (STOC). ACM, pp. 79-89.

APA

Holm, J., de Lichtenberg, K., & Thorup, M. (1998). Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge and biconnectivity. In Proceedings of the 30th ACM Symposium on the Theory of Computing (STOC) (pp. 79-89). ACM.

Vancouver

Holm J, de Lichtenberg K, Thorup M. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge and biconnectivity. In Proceedings of the 30th ACM Symposium on the Theory of Computing (STOC). ACM. 1998. p. 79-89

Author

Holm, Jacob ; de Lichtenberg, Kristian ; Thorup, Mikkel. / Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge and biconnectivity. Proceedings of the 30th ACM Symposium on the Theory of Computing (STOC). ACM, 1998. pp. 79-89

Bibtex

@inproceedings{403b5e5074ca11dbbee902004c4f4f50,
title = "Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge and biconnectivity",
author = "Jacob Holm and {de Lichtenberg}, Kristian and Mikkel Thorup",
year = "1998",
language = "English",
pages = "79--89",
booktitle = "Proceedings of the 30th ACM Symposium on the Theory of Computing (STOC)",
publisher = "ACM",

}

RIS

TY - GEN

T1 - Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge and biconnectivity

AU - Holm, Jacob

AU - de Lichtenberg, Kristian

AU - Thorup, Mikkel

PY - 1998

Y1 - 1998

M3 - Article in proceedings

SP - 79

EP - 89

BT - Proceedings of the 30th ACM Symposium on the Theory of Computing (STOC)

PB - ACM

ER -

ID: 213937