A simple systolic method to find all bridges of an undirected graph

DOI10.1016/0167-8191(89)90009-4zbMath0681.68092OpenAlexW2011078689MaRDI QIDQ1823709

Heiko Schröder, Manfred Schimmler

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0167-8191(89)90009-4

zbMATH Keywords

transitive closuresystolic algorithmmesh-connected processor arraybridges in graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99) Theory of operating systems (68N25)

This page was built for publication: A simple systolic method to find all bridges of an undirected graph