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

DOI10.1016/0167-8191(89)90009-4MaRDI QIDQ1823709zbMATH OpenOpenAlexFDO

Authors Manfred Schimmler, Heiko Schröder

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

bridges in graphsmesh-connected processor arraysystolic algorithmtransitive closure

Mathematics Subject Classification ID

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

Recommendations

• Efficient systolic algorithm for finding bridges in a connected graph
• A fully-pipelined systolic algorithm for finding bridges on an undirected connected graph
• Consequences of an algorithm for bridged graphs
• A simplified algorithm computing all \(s\)-\(t\) bridges and articulation points
• Bridges in Highly Connected Graphs
• An \(O(n^2)\) self-stabilizing algorithm for computing bridge-connected components
• Bridged graphs are cop-win graphs: An algorithmic proof
• A new algorithm to find all elementary circuits of a directed graph
• A self-stabilizing algorithm for bridge finding

Cited in

(4)

• Efficient systolic algorithm for finding bridges in a connected graph
• A fully-pipelined systolic algorithm for finding bridges on an undirected connected graph
• An efficient distributed bridge-finding algorithm
• A simple systolic method to find all bridges of an undirected graph

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823709)