Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and 
O(n1/2 - ε)-time

Nanongkai, Danupon; Saranurak, Thatchaphol

doi:10.1145/3055399.3055447

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n1/2 - ε)-time

MPS-Authors

/persons/resource/persons45102

Nanongkai, Danupon
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons79464

Saranurak, Thatchaphol
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Nanongkai, D., & Saranurak, T. (2017). Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n1/2 - ε)-time. In H. Hatami, P. McKenzie, & V. King (Eds.), STOC '17 (pp. 1122-1129). New York, NY: ACM.

Cite as: https://hdl.handle.net/21.11116/0000-000E-72AF-D

Abstract

There is no abstract available