• DocumentCode
    898001
  • Title

    Growing the trees of a graph

  • Author

    Brownell, R.A.

  • Volume
    56
  • Issue
    6
  • fYear
    1968
  • fDate
    6/1/1968 12:00:00 AM
  • Firstpage
    1121
  • Lastpage
    1123
  • Abstract
    An algorithm is described which generates without duplication and with appropriate sign all the trees of a graph containing directed elements. A path-finding algorithm is extended in an application of Mason´s method of expansion of paths.
  • Keywords
    Algorithm design and analysis; Application software; Computer networks; Heart; Resistors; Testing; Tree graphs; Visualization;
  • fLanguage
    English
  • Journal_Title
    Proceedings of the IEEE
  • Publisher
    ieee
  • ISSN
    0018-9219
  • Type

    jour

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