Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time

Article Details
Title:	Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time
Article URLs:	https://doi.org/10.1109/FOCS.2017.92 http://doi.ieeecomputersociety.org/10.1109/FOCS.2017.92
Alternative Article URLs:
Authors:	Danupon Nanongkai	KTH Royal Institute of Technology
	Thatchaphol Saranurak	KTH Royal Institute of Technology
	Christian Wulff-Nilsen	University of Copenhagen
Sharing:	Unknown
Verification:	Authors have not verified information
Artifact Evaluation Badge:	none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key:	conf/focs/NanongkaiSW17
Author Comments:

IEEE Foundations of Computer Science, FOCS 2017