Jul 2026
On the Impact of Stability and the Helly Property on the Dominating Set Problem
This work shows that -- with a simple change -- in the case of Dominating Set, one can get rid of the stability requirement and result in a fixed-parameter tractable algorithm on exactly those graph classes which do not contain long co-matchings or double-ladders as semi-induced subgraphs.
Che Cheng, Daniel Mock, Peter Rossmanith
· arXiv.org · 0 citations