|Title:||Minimum feedback vertex sets in circle graphs
|Abstract:||We describe a polynomial time algorithm to find a minimum feedback vertex set, or equivalently, a maximum induced forest, in a circle graph. The circle graphs are the overlap graphs of intervals on a line.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/2007/CS/CS-2007-05), rather than to the URL of the PDF or PS files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 2007
To the main CS technical reports page
Computer science department, Technion