For the most recent entries see the Petri Nets Newsletter.

An Improved Method of Enumerating all Trees and Minimal Paths in a Graph Using Petri Nets.

Kontoleon, J.M.; Mandaltsis, D.

In: Microelectronics and Reliability, Vol. 28, No. 5, pages 783-791. 1988.

Abstract: Two algorithms are presented in this paper. The first enumerates all the trees in a graph while the second enumerates all the minimal paths between two vertices of a graph. Both algorithms are based on the concept of reachability in Petri nets and they are fast and simple.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography