| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428780 | Information Processing Letters | 2008 | 6 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
