"On computing all minimal solutions for feedback problems"
Technical report by B. Schwikowski, Ewald Speckenmeyer, available as BibTeX Source, postscript file and compressed postscript file.
Informatik, Universität zu Köln
Preprint Key:	zpr97-287
Keywords:	directed graph, exact enumeration problem, feedback problem
MSC codes:	05A15, 05C20, 05C38, 05C85, 68Q25, 68W35
This technical report has 10 pages, was written in 1997, it has not been published.
Abstract:	We present an algorithm that generates all (inclusion-wise) minimal feedback vertex sets of a directed graph G=(V,E). The feedback vertex sets of G are generated with a polynomial delay of O(|V|2(|V|+|E|)). Variants of the algorithm generate all minimal solutions for the undirected case and the directed feedback arc set problem, both with a polynomial delay of O(|V|,|E|,(|V|+|E|).