Abstract
A fast algorithm for finding minimal feedback vertex sets is presented. The algorithm uses the principle that any minimal feedback vertex set must contain exactly one vertex from each minimal cycle. Depth-first search is used to implement the algorithm efficiently.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
