• DocumentCode
    903851
  • Title

    Enumeration of all circuits of a graph

  • Author

    Bapeswara Rao, V.V. ; Murti, V.G.K.

  • Volume
    57
  • Issue
    4
  • fYear
    1969
  • fDate
    4/1/1969 12:00:00 AM
  • Firstpage
    700
  • Lastpage
    701
  • Abstract
    An algorithm is presented to enumerate all circuits of a linear graph. The method is suitable for computerization and does not require a large computer memory. The application of the procedure to some other enumeration problems is discussed.
  • Keywords
    Application software; Circuit testing; Tree graphs;
  • fLanguage
    English
  • Journal_Title
    Proceedings of the IEEE
  • Publisher
    ieee
  • ISSN
    0018-9219
  • Type

    jour

  • DOI
    10.1109/PROC.1969.7032
  • Filename
    1448962
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=903851