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 fam...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on circuits and systems 1975-01, Vol.22 (1), p.9-15
Hauptverfasser:	Smith, G., Walford, R.
Format:	Artikel
Sprache:	eng
Schlagworte:	Circuit simulation Circuit testing Computational modeling Feedback Graph theory Logic circuits Logic testing Pathology Sequential analysis Sequential circuits
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!