Seminar

Papers List

Improved Dynamic Reachability Algorithms for Directed Graphs.

Liam Roditty, Uri Zwick

SIAM J. Comput. 37(5): 1455-1471 (2008)

Improved Deterministic Algorithms for Decremental Reachability and Strongly Connected Components.

Jakub Lacki

ACM Trans. Algorithms 9(3): 27:1-27:15 (2013)

Sublinear-Time Decremental Algorithms for Single-Source Reachability and Shortest Paths on Directed Graphs

Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai

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

FOCS 2016: 315-324