• DocumentCode
    1169024
  • Title

    A note on minimal essential sets

  • Author

    Guardabassi, G.

  • Volume
    18
  • Issue
    5
  • fYear
    1971
  • fDate
    9/1/1971 12:00:00 AM
  • Firstpage
    557
  • Lastpage
    560
  • Abstract
    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.
  • Keywords
    Graph theory; Network topology; Admittance; Circuit theory; Circuits and systems; Computer networks; Contracts; Electronic circuits; Performance analysis; Transfer functions; Tree graphs; Voltage;
  • fLanguage
    English
  • Journal_Title
    Circuit Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9324
  • Type

    jour

  • DOI
    10.1109/TCT.1971.1083332
  • Filename
    1083332
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1169024