Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge and Biconnectivity

Bidragets oversatte titel: Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge and Biconnectivity

Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup

256 Citationer (Scopus)

Bidragets oversatte titel	Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge and Biconnectivity
Originalsprog	Engelsk
Tidsskrift	Journal of the ACM
Vol/bind	48
Udgave nummer	4
Sider (fra-til)	723-760
Antal sider	38
ISSN	0004-5411
Status	Udgivet - 2001
Udgivet eksternt	Ja

Citationsformater

@article{699dc7bd89ed4fa381abcfa6f52a7c71,

title = "Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge and Biconnectivity",

author = "Jacob Holm and Lichtenberg, {Kristian de} and Mikkel Thorup",

note = "Announced at STOC'98",

year = "2001",

language = "English",

volume = "48",

pages = "723--760",

journal = "Journal of the ACM",

issn = "0004-5411",

publisher = "Association for Computing Machinery",

number = "4",

}

TY - JOUR

T1 - Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge and Biconnectivity

AU - Holm, Jacob

AU - Lichtenberg, Kristian de

AU - Thorup, Mikkel

N1 - Announced at STOC'98

PY - 2001

Y1 - 2001

M3 - Journal article

SN - 0004-5411

VL - 48

SP - 723

EP - 760

JO - Journal of the ACM

JF - Journal of the ACM

IS - 4

ER -