The identification of a minimal feedback vertex set of a directed graph

This paper describes an algorithm for the identification of a minimal feedback vertex set of an arbitrary directed graph. Such a set of vertices has the property that removal of these vertices from the graph eliminates all directed loops. An efficient solution to this identification problem is a familiar unsolved problem of contemporary graph theory. Although pathological examples exist for which excessive computation v2 time may be required, the described algorithm appears to be quite v efficient for large graphs arising in practical applications. The algorithm seems to have great potential in the field of test generation for sequential logic circuits and certain types of simulation algorithms. No attempt is V3 made to impose restrictive conditions on the particular minimum feedback vertex set selected, although such restrictions may at times be desirable. The algorithm has been implemented on an IBM 360/67 and has been successfully applied to practical (logic circuit) problems having in excess of 2500 vertices.