This is the authors' abstract. We don't add key points for this paper.
A completely topological algorithm for determining a minimal essential set (minimum feedback vertex set) of a linear oriented graph is presented. From a logical point of view, the algorithm is a modified version of the well-known McCluskey method for the prime implicant problem of switching theory. From a computational point of view, it avoids the need of the covering table, i.e., the need of generating the set of the elementary circuits of the graph.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
G. Guardabassi (1971) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: