Jul 2026
Dynamic domination and independence in sparse graphs
It is proved that in graphs of degeneracy at most $d, one can maintain an ${cal O}(d^2)$-approximation of the minimum size of a (distance-$1) dominating set with amortized expected update time $d^{{\cal O}(1)}\cdot \log n$.
B. Bosek, Wojciech Nadara, Michał Pilipczuk et al.
· arXiv.org · 0 citations