Efficient systolic algorithm for finding bridges in a connected graph

DOI10.1016/0167-8191(88)90005-1zbMath0639.68059OpenAlexW2068873943MaRDI QIDQ1099959

B. George

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0167-8191(88)90005-1

zbMATH Keywords

VLSIbridgessystolic arraysystolic algorithmarea and time complexityn-node connected graphn\(\times n\) array of processing elements

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Theory of operating systems (68N25) Theory of software (68N99)

Related Items (4)

A systolic algorithm for solving knapsack problems ⋮ Systolic algorithm for the solution of dense linear equations ⋮ A systolic algorithm for solving dense linear systems ⋮ A simple systolic method to find all bridges of an undirected graph

This page was built for publication: Efficient systolic algorithm for finding bridges in a connected graph