Regular iterative algorithm for extracting all trees of a linear graph

Author

Joshi, Shridhar P. ; Priemer, Roland

Author_Institution

Dept. of Electr. Eng. & Comput. Sci., Illinois Univ., Chicago, IL, USA

fYear

1992

Firstpage

1408

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

Keywords

iterative methods; logic arrays; logic design; trees (mathematics); incidence matrix; linear graph; processor array; regular iterative algorithm; tree extraction; Circuits; Difference equations; Iterative algorithms; Optical wavelength conversion; Systolic arrays; Tree graphs;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 1992., Proceedings of the 35th Midwest Symposium on

Conference_Location

Washington, DC

Print_ISBN

0-7803-0510-8

Type

conf

DOI

10.1109/MWSCAS.1992.271075

Filename

271075

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1615579