@inproceedings{aa077cb650df4a7ca9d690a62256d2ae,
title = "Decremental Single-Source Reachability and Strongly Connected Components in {\~O}(m√n) Total Update Time",
abstract = "We present randomized algorithms with a total update time of {\~O}(m √n) for the problems of decremental single source reachability and decremental strongly connected components on directed graphs. This improves recent breakthrough results of Henzinger, Krinninger and Nanongkai [STOC 14, ICALP 15]. In addition, our algorithms are arguably simpler.",
keywords = "Dynamic algorithm, Single-source reachability, Strongly connected components",
author = "Shiri Chechik and Hansen, \{Thomas Dueholm\} and Italiano, \{Giuseppe F.\} and Jakub Lacki and Nikos Parotsidis",
note = "Publisher Copyright: {\textcopyright} 2016 IEEE.; 57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016 ; Conference date: 09-10-2016 Through 11-10-2016",
year = "2016",
month = dec,
day = "14",
doi = "10.1109/FOCS.2016.42",
language = "الإنجليزيّة",
series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",
publisher = "IEEE Computer Society",
pages = "315--324",
booktitle = "Proceedings - 57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016",
address = "الولايات المتّحدة",
}