A Petri net approach to enumerating all circuits of a graph |
| |
| Authors: | G.S Hura |
| |
| Affiliation: | Electronics Department, Regional Engineering College, Kurukshetra, 132119, India |
| |
| Abstract: | A technique utilizing the concept of reachability in Petri net is proposed to enumerate all the circuits of a graph. The proposed technique requires only vector additions on the columns of a single matrix. The present method which is a simple and applicable to both directed and undirected graphs, can easily be computerised. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
