A fully-pipelined systolic algorithm for finding bridges on an undirected connected graph

A new fully-pipelined systolic algorithm for finding all the bridges of an undirected connected graph is proposed. Given a graph of n vertices and m edges, the proposed algorithm uses (2n−2) systolic cells and runs in ( m + 3 n − 3) systolic cycles. This improves a previous result. The use of fully-...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Parallel computing 1992-04, Vol.18 (4), p.377-391
Hauptverfasser:	Hsu, Su-Chu, Hsieh, Hsien-Fen, Huang, Shing-Tsaan
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences bridges Computer science control theory systems Exact sciences and technology spanning trees systolic algorithm Theoretical computing Undirected connected graph
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!