7 citations · 11 across the 2 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.DM2018
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 ,…
cs.DS2018
Reconfiguration of graph minors
Benjamin Moore, Naomi Nishimura, Vijay Subramanya
Under the reconfiguration framework, we consider the various ways that a target graph is a {\em minor} of a host graph , where a subgraph of can be transformed into …
cs.DS2018
Reconfiguring spanning and induced subgraphs
Tesshu Hanaka, Takehiro Ito, Haruka Mizuta +5
Subgraph reconfiguration is a family of problems focusing on the reachability of the solution space in which feasible solutions are subgraphs, represented either as sets of vertice…