Recent advances in fully dynamic graph algorithms–a quick reference guide

K Hanauer, M Henzinger, C Schulz - ACM Journal of Experimental …, 2022 - dl.acm.org
In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …

Recent advances in fully dynamic graph algorithms

K Hanauer, M Henzinger, C Schulz - arXiv preprint arXiv:2102.11169, 2021 - arxiv.org
In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …

A fully dynamic reachability algorithm for directed graphs with an almost linear update time

L Roditty, U Zwick - Proceedings of the thirty-sixth annual ACM …, 2004 - dl.acm.org
We obtain a new fully dynamic algorithm for the reachability problem in directed graphs. Our
algorithm has an amortized update time of O (m+ n log n) and a worst-case query time of O …

Improved dynamic reachability algorithms for directed graphs

L Roditty, U Zwick - SIAM Journal on Computing, 2008 - SIAM
We obtain several new dynamic algorithms for maintaining the transitive closure of a
directed graph and several other algorithms for answering reachability queries without …

Decremental strongly-connected components and single-source reachability in near-linear time

A Bernstein, M Probst, C Wulff-Nilsen - … of the 51st Annual ACM SIGACT …, 2019 - dl.acm.org
Computing the Strongly-Connected Components (SCCs) in a graph G=(V, E) is known to
take only O (m+ n) time using an algorithm by Tarjan from 1972 [SICOMP 72] where m=| E …

OLAP over uncertain and imprecise data

D Burdick, PM Deshpande, TS Jayram… - The VLDB Journal, 2007 - Springer
We extend the OLAP data model to represent data ambiguity, specifically imprecision and
uncertainty, and introduce an allocation-based approach to the semantics of aggregation …

Deterministic fully dynamic sssp and more

J Van Den Brand, A Karczmarz - 2023 IEEE 64th Annual …, 2023 - ieeexplore.ieee.org
We present the first non-trivial fully dynamic algorithm maintaining exact single-source
distances in unweighted graphs. This resolves an open problem stated by Sankowski …

Dynamic graph algorithms

C Demetrescu, D Eppstein, Z Galil… - Algorithms and Theory …, 2009 - taylorfrancis.com
In many applications of graph algorithms, including communication networks, graphics,
assembly planning, and VLSI design, graphs are subject to discrete changes, such as …

Improved deterministic algorithms for decremental reachability and strongly connected components

J Łącki - ACM Transactions on Algorithms (TALG), 2013 - dl.acm.org
This article presents a new deterministic algorithm for decremental maintenance of the
transitive closure in a directed graph. The algorithm processes any sequence of edge …

Subquadratic dynamic path reporting in directed graphs against an adaptive adversary

A Karczmarz, A Mukherjee, P Sankowski - Proceedings of the 54th …, 2022 - dl.acm.org
We study reachability and shortest paths problems in dynamic directed graphs. Whereas
algebraic dynamic data structures supporting edge updates and reachability/distance …