Incremental optimization of independent sets under the reconfiguration framework

Suppose that we are given an independent set I 0 of a graph G , and an integer l ≥ 0 . Then, we are asked to find an independent set of G having the maximum size among independent sets that are reachable from I 0 by either adding or removing a single vertex at a time such that all intermediate indep...

Ausführliche Beschreibung