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

Shiri Chechik; Thomas Dueholm Hansen; Giuseppe F. Italiano; Jakub Lacki; Nikos Parotsidis

doi:10.1109/FOCS.2016.42

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

Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Jakub Lacki, Nikos Parotsidis

School of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We present randomized algorithms with a total update time of Õ(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.

Original language	English
Title of host publication	Proceedings - 57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016
Publisher	IEEE Computer Society
Pages	315-324
Number of pages	10
ISBN (Electronic)	9781509039333
DOIs	https://doi.org/10.1109/FOCS.2016.42
State	Published - 14 Dec 2016
Event	57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016 - New Brunswick, United States Duration: 9 Oct 2016 → 11 Oct 2016

Publication series

Name	Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Volume	2016-December
ISSN (Print)	0272-5428

Conference

Conference	57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016
Country/Territory	United States
City	New Brunswick
Period	9/10/16 → 11/10/16

Keywords

Dynamic algorithm
Single-source reachability
Strongly connected components

Access to Document

10.1109/FOCS.2016.42

Cite this

Chechik, S., Hansen, T. D., Italiano, G. F., Lacki, J., & Parotsidis, N. (2016). Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update Time. In Proceedings - 57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016 (pp. 315-324). [7782945] (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; Vol. 2016-December). IEEE Computer Society. https://doi.org/10.1109/FOCS.2016.42

Chechik, Shiri ; Hansen, Thomas Dueholm ; Italiano, Giuseppe F. et al. / Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update Time. Proceedings - 57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016. IEEE Computer Society, 2016. pp. 315-324 (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

@inproceedings{5a612118befa410088d3ac1b4c55c770,

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 = "ארצות הברית",

}

Chechik, S, Hansen, TD, Italiano, GF, Lacki, J & Parotsidis, N 2016, Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update Time. in Proceedings - 57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016., 7782945, Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS, vol. 2016-December, IEEE Computer Society, pp. 315-324, 57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016, New Brunswick, United States, 9/10/16. https://doi.org/10.1109/FOCS.2016.42

Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update Time. / Chechik, Shiri; Hansen, Thomas Dueholm; Italiano, Giuseppe F. et al.
Proceedings - 57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016. IEEE Computer Society, 2016. p. 315-324 7782945 (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; Vol. 2016-December).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Chechik, Shiri

AU - Hansen, Thomas Dueholm

AU - Italiano, Giuseppe F.

AU - Lacki, Jakub

AU - Parotsidis, Nikos

PY - 2016/12/14

Y1 - 2016/12/14

N2 - We present randomized algorithms with a total update time of Õ(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.

AB - We present randomized algorithms with a total update time of Õ(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.

KW - Dynamic algorithm

KW - Single-source reachability

KW - Strongly connected components

UR - http://www.scopus.com/inward/record.url?scp=85009348938&partnerID=8YFLogxK

U2 - 10.1109/FOCS.2016.42

DO - 10.1109/FOCS.2016.42

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85009348938

T3 - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

SP - 315

EP - 324

BT - Proceedings - 57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016

PB - IEEE Computer Society

T2 - 57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016

Y2 - 9 October 2016 through 11 October 2016

ER -

Chechik S, Hansen TD, Italiano GF, Lacki J, Parotsidis N. Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update Time. In Proceedings - 57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016. IEEE Computer Society. 2016. p. 315-324. 7782945. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS). doi: 10.1109/FOCS.2016.42

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

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this