A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
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 I_0 of a graph G, and an integer l > 0 which represents a lower bound on the size of any independent set of G. 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 independent sets arearXiv:1804.09422v1 fatcat:rjjvttvz6jdhxcsbt3h2qjynze