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 …
Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture
M Henzinger, S Krinninger, D Nanongkai… - Proceedings of the forty …, 2015 - dl.acm.org
Consider the following Online Boolean Matrix-Vector Multiplication problem: We are given
an nxn matrix M and will receive n column-vectors of size n, denoted by v1,..., vn, one by …
an nxn matrix M and will receive n column-vectors of size n, denoted by v1,..., vn, one by …
Popular conjectures imply strong lower bounds for dynamic problems
A Abboud, VV Williams - 2014 IEEE 55th Annual Symposium …, 2014 - ieeexplore.ieee.org
We consider several well-studied problems in dynamic algorithms and prove that sufficient
progress on any of them would imply a breakthrough on one of five major open problems in …
progress on any of them would imply a breakthrough on one of five major open problems in …
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 …
Higher lower bounds from the 3SUM conjecture
The 3SUM conjecture has proven to be a valuable tool for proving conditional lower bounds
on dynamic data structures and graph problems. This line of work was initiated by Pâtraşcu …
on dynamic data structures and graph problems. This line of work was initiated by Pâtraşcu …
Fully dynamic maximal matching in constant update time
S Solomon - 2016 IEEE 57th Annual Symposium on …, 2016 - ieeexplore.ieee.org
Baswana, Gupta and Sen [FOCS'11] showed that fully dynamic maximal matching can be
maintained in general graphs with logarithmic amortized update time. More specifically …
maintained in general graphs with logarithmic amortized update time. More specifically …
Faster fully dynamic matchings with small approximation ratios
A Bernstein, C Stein - Proceedings of the twenty-seventh annual ACM-SIAM …, 2016 - SIAM
Maximum cardinality matching is a fundamental algorithmic problem with many algorithms
and applications. The fully dynamic version, in which edges are inserted and deleted over …
and applications. The fully dynamic version, in which edges are inserted and deleted over …
Fully dynamic (1+ e)-approximate matchings
We present the first data structures that maintain near optimal maximum cardinality and
maximum weighted matchings on sparse graphs in sub linear time per update. Our main …
maximum weighted matchings on sparse graphs in sub linear time per update. Our main …
Dynamic algorithms for maximum matching size
S Behnezhad - Proceedings of the 2023 Annual ACM-SIAM …, 2023 - SIAM
We study fully dynamic algorithms for maximum matching. This is a well-studied problem,
known to admit several update-time/approximation trade-offs. For instance, it is known how …
known to admit several update-time/approximation trade-offs. For instance, it is known how …
Dynamic matrix inverse: Improved algorithms and matching conditional lower bounds
J van den Brand, D Nanongkai… - 2019 IEEE 60th Annual …, 2019 - ieeexplore.ieee.org
The dynamic matrix inverse problem is to maintain the inverse of a matrix undergoing
element and column updates. It is the main subroutine behind the best algorithms for many …
element and column updates. It is the main subroutine behind the best algorithms for many …