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

DOI10.1007/3-540-50728-0_49MaRDI QIDQ6118597

Manfred Schimmler, Heiko Schröder

Publication date: 28 February 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Cites Work

• Unnamed Item
• Efficient systolic algorithm for finding bridges in a connected graph
• Graph Problems on a Mesh-Connected Processor Array

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