Dynamic Minimum Spanning Forest with Subpolynomial Worst-case Update Time

Danupon Nanongkai; Thatchaphol Saranurak; Christian Wulff-Nilsen

doi:10.1109/FOCS.2017.92

Dynamic Minimum Spanning Forest with Subpolynomial Worst-case Update Time

Danupon Nanongkai, Thatchaphol Saranurak, Christian Wulff-Nilsen

Department of Computer Science

40 Citations (Scopus)

Original language	English
Title of host publication	2017 IEEE 58th Annual IEEE Symposium on Foundations of Computer Science (FOcS)
Publisher	IEEE
Publication date	10 Nov 2017
Pages	950-961
DOIs	https://doi.org/10.1109/FOCS.2017.92
Publication status	Published - 10 Nov 2017
Event	58th Annual IEEE Symposium on Foundations of Computer Science - Berkeley, United States Duration: 15 Oct 2017 → 17 Oct 2017 Conference number: 58

Conference

Conference	58th Annual IEEE Symposium on Foundations of Computer Science
Number	58
Country/Territory	United States
City	Berkeley
Period	15/10/2017 → 17/10/2017

Keywords

dynamic graph algorithms
minimum spanning forests
graph decomposition

Access to Document

10.1109/FOCS.2017.92

Cite this

Nanongkai, D, Saranurak, T & Wulff-Nilsen, C 2017, Dynamic Minimum Spanning Forest with Subpolynomial Worst-case Update Time. in 2017 IEEE 58th Annual IEEE Symposium on Foundations of Computer Science (FOcS). IEEE, pp. 950-961, 58th Annual IEEE Symposium on Foundations of Computer Science, Berkeley, California, United States, 15/10/2017. https://doi.org/10.1109/FOCS.2017.92

@inproceedings{af070d5e0e6348d69762fe4e4d3a9b5c,

title = "Dynamic Minimum Spanning Forest with Subpolynomial Worst-case Update Time",

keywords = "dynamic graph algorithms, minimum spanning forests, graph decomposition",

author = "Danupon Nanongkai and Thatchaphol Saranurak and Christian Wulff-Nilsen",

year = "2017",

month = nov,

day = "10",

doi = "10.1109/FOCS.2017.92",

language = "English",

pages = "950--961",

booktitle = "2017 IEEE 58th Annual IEEE Symposium on Foundations of Computer Science (FOcS)",

publisher = "IEEE",

note = "58th Annual IEEE Symposium on Foundations of Computer Science ; Conference date: 15-10-2017 Through 17-10-2017",

}

TY - GEN

T1 - Dynamic Minimum Spanning Forest with Subpolynomial Worst-case Update Time

AU - Nanongkai, Danupon

AU - Saranurak, Thatchaphol

AU - Wulff-Nilsen, Christian

N1 - Conference code: 58

PY - 2017/11/10

Y1 - 2017/11/10

KW - dynamic graph algorithms

KW - minimum spanning forests

KW - graph decomposition

U2 - 10.1109/FOCS.2017.92

DO - 10.1109/FOCS.2017.92

M3 - Article in proceedings

SP - 950

EP - 961

BT - 2017 IEEE 58th Annual IEEE Symposium on Foundations of Computer Science (FOcS)

PB - IEEE

T2 - 58th Annual IEEE Symposium on Foundations of Computer Science

Y2 - 15 October 2017 through 17 October 2017

ER -

Dynamic Minimum Spanning Forest with Subpolynomial Worst-case Update Time

Conference

Keywords

Access to Document

Fingerprint

Cite this