Definition: The smallest set of edges whose deletion results in an acyclic graph.
See also feedback vertex set.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 2 September 2014.
HTML page formatted Wed Mar 13 12:42:45 2019.
Cite this as:
Paul E. Black, "feedback edge set", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 2 September 2014. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/feedbackEdgeSet.html