(definition)
Definition: The smallest set of vertices whose deletion results in an acyclic graph.
See also feedback edge set.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 26 July 2021.
HTML page formatted Mon Jul 26 11:58:06 2021.
Cite this as:
Paul E. Black, "feedback vertex set", in
Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 26 July 2021. (accessed TODAY)
Available from: https://www.nist.gov/dads/HTML/feedbackVertexSet.html