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

Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup

47 Citationer (Scopus)

Originalsprog	Engelsk
Titel	Proceedings of the 30th ACM Symposium on the Theory of Computing (STOC)
Forlag	ACM
Publikationsdato	1998
Sider	79-89
Status	Udgivet - 1998
Udgivet eksternt	Ja

Citationsformater

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

Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › 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",

}