16 citations · 52 across the 11 of their papers we have counts for
Showing 2014 · cs.DMShow all
2 papers · 2 filters
cs.DM2014★ 10 cited
Reconfiguring Independent Sets in Claw-Free Graphs
Paul Bonsma, Marcin Kamiński, Marcin Wrochna
We present a polynomial-time algorithm that, given two independent sets in a claw-free graph , decides whether one can be transformed into the other by a sequence of elementary…
cs.DM2014★ 8 cited
Independent Set Reconfiguration in Cographs
Paul Bonsma
We study the following independent set reconfiguration problem, called TAR-Reachability: given two independent sets and of a graph , both of size at least , is it pos…