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

Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup

47 Citations (Scopus)

Original language	English
Title of host publication	Proceedings of the 30th ACM Symposium on the Theory of Computing (STOC)
Publisher	ACM
Publication date	1998
Pages	79-89
Publication status	Published - 1998
Externally published	Yes

Cite this

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

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

@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",

}