1 citations · 1 across the 1 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2019
Decremental Optimization of Dominating Sets Under the Reconfiguration Framework
Alexandre Blanché, Haruka Mizuta, Paul Ouvrard +1
Given a dominating set, how much smaller a dominating set can we find through elementary operations? Here, we proceed by iterative vertex addition and removal while maintaining the…
cs.DM2018★ 1 cited
Incremental Optimization of Independent Sets under Reachability Constraints
Takehiro Ito, Haruka Mizuta, Naomi Nishimura +1
We introduce a new framework for reconfiguration problems, and apply it to independent sets as the first example. Suppose that we are given an independent set of a graph ,…