Regular iterative algorithm for extracting all trees of a linear graph

Abstract

A regular iterative algorithm (RIA) to extract all trees of a linear graph is presented. The algorith is developed from a sequential algorithm that operates on the incidence matrix of a graph. This RIA can be used to design a processor array that can find trees of a graph at a rate that is independent of the number of graph edges. The RIA is the basis for a processor array that finds one tree of a graph in O(N) time, where N is the number of graph vertices. >