Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update Time

Article Details
Title:	Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update Time
Article URLs:	https://doi.org/10.1109/FOCS.2016.42 http://doi.ieeecomputersociety.org/10.1109/FOCS.2016.42
Alternative Article URLs:
Authors:	Shiri Chechik	Tel Aviv University
	Thomas Dueholm Hansen	Aarhus University
	Giuseppe F. Italiano	University of Rome Tor Vergata
	Jakub Lacki	Sapienza University of Rome
	Nikos Parotsidis	University of Rome Tor Vergata
Sharing:	Research produced no artifacts
Verification:	Authors have verified information
Artifact Evaluation Badge:	none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key:	conf/focs/ChechikHILP16
Author Comments:

IEEE Foundations of Computer Science, FOCS 2016