Recent advances in fully dynamic graph algorithms–a quick reference guide
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 …
dynamic algorithms. However, these theoretical results have received very little attention …
Recent advances in fully dynamic graph algorithms
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 …
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
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 …
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
We obtain several new dynamic algorithms for maintaining the transitive closure of a
directed graph and several other algorithms for answering reachability queries without …
directed graph and several other algorithms for answering reachability queries without …
Decremental strongly-connected components and single-source reachability in near-linear time
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 …
take only O (m+ n) time using an algorithm by Tarjan from 1972 [SICOMP 72] where m=| E …
OLAP over uncertain and imprecise data
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 …
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 …
distances in unweighted graphs. This resolves an open problem stated by Sankowski …
Dynamic graph algorithms
In many applications of graph algorithms, including communication networks, graphics,
assembly planning, and VLSI design, graphs are subject to discrete changes, such as …
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 …
transitive closure in a directed graph. The algorithm processes any sequence of edge …
Subquadratic dynamic path reporting in directed graphs against an adaptive adversary
We study reachability and shortest paths problems in dynamic directed graphs. Whereas
algebraic dynamic data structures supporting edge updates and reachability/distance …
algebraic dynamic data structures supporting edge updates and reachability/distance …