(definition)
Definition: The smallest set of edges whose deletion results in an acyclic graph.
See also feedback vertex set.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 12:28:05 2004.
HTML page formatted Wed Oct 26 09:47:31 2005.
Cite this as:
Paul E. Black, "feedback edge set", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/feedbackEdgeSet.html
