• DocumentCode
    1234755
  • Title

    Generation of all Cutsets of a Bipath Network

  • Author

    Toida, S.

  • Author_Institution
    Faculty of Engineering, Univ. of Waterloo, Waterloo, Ont., Canada
  • Volume
    21
  • Issue
    12
  • fYear
    1973
  • fDate
    12/1/1973 12:00:00 AM
  • Firstpage
    1414
  • Lastpage
    1417
  • Abstract
    An algorithm to find the Hamiltonian circuit in a bipath network is developed. Using the Hamiltonian circuit all cutsets of a bipath network are generated from incidence sets in a systematic way without duplication. Also it is shown that the algorithm to find the Hamiltonian circuit can be used to test a graph for bipathness.
  • Keywords
    Communication networks; Channel capacity; Circuit testing; Circuit topology; Communication networks; Communications Society; Computer networks; Councils; Design optimization; Mathematical programming; Network topology;
  • fLanguage
    English
  • Journal_Title
    Communications, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0090-6778
  • Type

    jour

  • DOI
    10.1109/TCOM.1973.1091598
  • Filename
    1091598
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1234755