Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time

Gramoz Goranci, Monika Henzinger, Mikkel Thorup

5 Citationer (Scopus)

Originalsprog	Engelsk
Artikelnummer	17
Tidsskrift	ACM Transactions on Algorithms
Vol/bind	14
Udgave nummer	2
ISSN	1549-6325
DOI	https://doi.org/10.1115/3174803
Status	Udgivet - mar. 2018

Adgang til dokumentet

@article{40778663862e41e7a552f2999629557b,

title = "Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time",

keywords = "Minimum cut, edge connectivity, space-efficient dynamic graph algorithms",

author = "Gramoz Goranci and Monika Henzinger and Mikkel Thorup",

year = "2018",

month = mar,

doi = "10.1115/3174803",

language = "English",

volume = "14",

journal = "ACM Transactions on Algorithms",

issn = "1549-6325",

publisher = "Association for Computing Machinery, Inc.",

number = "2",

}

TY - JOUR

T1 - Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time

AU - Goranci, Gramoz

AU - Henzinger, Monika

AU - Thorup, Mikkel

PY - 2018/3

Y1 - 2018/3

KW - Minimum cut

KW - edge connectivity

KW - space-efficient dynamic graph algorithms

U2 - 10.1115/3174803

DO - 10.1115/3174803

M3 - Journal article

SN - 1549-6325

VL - 14

JO - ACM Transactions on Algorithms

JF - ACM Transactions on Algorithms

IS - 2

M1 - 17

ER -