Regular iterative algorithm for extracting all trees of a linear graph

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 independe...

Full description

Saved in:
Bibliographic Details
Main Authors: Joshi, S.P., Priemer, R.
Format: Conference Proceeding
Language:English
Subjects:
Circuits
Difference equations
Iterative algorithms
Optical wavelength conversion
Systolic arrays
Tree graphs
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.< >
DOI:10.1109/MWSCAS.1992.271075