Citation

Hura GS. Reliab. Eng. 1984; 7(4): 229-233.

Copyright

(Copyright © 1984, Elsevier Publishing)

DOI

10.1016/0143-8174(84)90027-1

PMID

unavailable

Abstract

A technique utilizing the reachability concept of Petri nets for the enumeration of all the trees in a graph is proposed. Unlike the existing methods, the proposed technique does not require the selection of an arbitrary tree as the first step. Furthermore, instead of a larger number o steps being involved, only vector additions on a single matrix are needed. This alleviates the computational effort. The proposed technique is simple and easily adaptable on digital computers.