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-pipelined cells and the uniformity of the operations in each cell make the proposed algorithm distinctive.