• DocumentCode
    955132
  • Title

    Petri net approach to enumerate all simple paths in a graph

  • Author

    Khan, Ali Athar ; Singh, Harpreet

  • Author_Institution
    University of Roorkee, Electronics & Communication Engineering Department, Roorkee, India
  • Volume
    16
  • Issue
    8
  • fYear
    1980
  • Firstpage
    291
  • Lastpage
    292
  • Abstract
    A technique utilising the concept of reachability in a Petri net is proposed to enumerate all simple paths between two specified nodes of a graph. It is simple and requires little computation.
  • Keywords
    graph theory; Petri net approach; enumerate all simple paths between two specified nodes; graph theory; reachability concept;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el:19800212
  • Filename
    4243977
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=955132