• DocumentCode
    883940
  • Title

    Comments on "Enumeration of all minimal cutsets for a node pair in a graph

  • Author

    Sankar, V. ; Prasad, V.C. ; Rao, K. S Prakasa

  • Author_Institution
    Indian Inst. of Technol., Delhi, India
  • Volume
    42
  • Issue
    1
  • fYear
    1993
  • fDate
    3/1/1993 12:00:00 AM
  • Firstpage
    44
  • Lastpage
    45
  • Abstract
    The commenters point out that the algorithm of S.A. Kumar and S.H. Lee for the enumeration of all minimal s-t cutsets is defective (see ibid., vol.R-26, p.51-5, April 1979). It is illustrated through an example that their algorithm misses several minimal cutsets. The commenters cite two reasons for this: the adjacency problem and the back-vertex problem.<>
  • Keywords
    graph theory; reliability theory; set theory; adjacency problem; back-vertex problem; enumeration; graph; minimal cutsets; node pair; reliability; s-t cutsets; Graph theory; Partitioning algorithms; Reliability theory;
  • fLanguage
    English
  • Journal_Title
    Reliability, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9529
  • Type

    jour

  • DOI
    10.1109/24.210269
  • Filename
    210269
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=883940