• DocumentCode
    1181126
  • Title

    Minimum-length fundamental cycle set

  • Author

    Deo, Narsingh

  • Volume
    26
  • Issue
    10
  • fYear
    1979
  • fDate
    10/1/1979 12:00:00 AM
  • Firstpage
    894
  • Lastpage
    895
  • Abstract
    Significance of a spanning tree which yields a fundamental set of cycles with minimum total length is discussed. It is shown through a counter example that for this problem a locally optimal spanning tree need not be globally optimal, as conjectured earlier in the literature.
  • Keywords
    Graph theory; Circuits and systems; Computational complexity; Counting circuits; Data structures; Polynomials; Tree graphs;
  • fLanguage
    English
  • Journal_Title
    Circuits and Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0098-4094
  • Type

    jour

  • DOI
    10.1109/TCS.1979.1084563
  • Filename
    1084563
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1181126