Minimum weight feedback vertex sets in circle graphs
We describe a polynomial time algorithm to find a minimum weight feedback vertex set, or equivalently, a maximum weight induced forest, in a circle graph. The circle graphs are the overlap graphs of intervals on a line. (C) 2007 Elsevier B.V. All rights reserved.
circle graph minimum feedback vertex set maximum induced forest graph algorithms