Cart (Loading....) | Create Account
Close category search window
 

Petri net approach to enumerate all simple paths in a graph

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Khan, Ali Athar ; University of Roorkee, Electronics & Communication Engineering Department, Roorkee, India ; Singh, Harpreet

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.

Published in:

Electronics Letters  (Volume:16 ,  Issue: 8 )

Date of Publication:

April 10 1980

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.