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

DOI10.1016/0167-8191(92)90134-SzbMath0792.68130OpenAlexW2093295391MaRDI QIDQ1195171

Su-Chu Hsu, Shing-Tsaan Huang, Hsien-Fen Hsieh

Publication date: 7 October 1992

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(92)90134-s

zbMATH Keywords

bridgesspanning treessystolic algorithmundirected connected graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: A fully-pipelined systolic algorithm for finding bridges on an undirected connected graph