• DocumentCode
    1344268
  • Title

    Enumeration of All Minimal Cut-Sets for a Node Pair in a Graph

  • Author

    Arunkumar, S. ; Lee, S.H.

  • Author_Institution
    Computer Center; Indian Institute of Technology; Powai, Bombay - 400 076 INDIA.
  • Issue
    1
  • fYear
    1979
  • fDate
    4/1/1979 12:00:00 AM
  • Firstpage
    51
  • Lastpage
    55
  • Abstract
    This paper presents an efficient implicit enumeration algorithm for generating all minimal cut-sets separating a specified node pair in a connected graph. The arcs in the graph need not be directed. By stopping or branching at appropriate levels, the algorithm yields two connected subgraphs, each containing one of the nodes to be separated, with the number of nodes in one of the subgraphs less than any specified value.
  • Keywords
    Algebra; Character generation; Computer networks; Graph theory; Power systems; Reliability theory; Tree graphs; Cut-sets; Graph; Implicit enumeration;
  • fLanguage
    English
  • Journal_Title
    Reliability, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9529
  • Type

    jour

  • DOI
    10.1109/TR.1979.5220473
  • Filename
    5220473
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1344268