Answers are grounded in this paper and cite their sources.
The problem of finding a minimum feedback vertex set (MFVS) in a directed graph has been known to be NP-hard for around 40 years: It is one of the problems listed in Karp’s famous 1972 paper. Several strategies to solve the MFVS problem, both exact and approximate, have been proposed. In particular, in 2000, Lin and Jou presented an exact algorithm based on eight graph contraction operators whose complexity is polynomial for a particular class of graphs called DOME-contractible graphs. This paper proposes two contributions. First, we introduce a data structure called union-cat tree that provides, in some cases, a compact representation of a family of constant size subsets of a given finite set. Secondly, we extend Lin and Jou’s algorithm to compute the set of all MFVSs of any directed graph.
No takes yet. Share an insight, caveat, or question.
Abdenbi et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: