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
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;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19800212
