A general program scheme for finding bridges

DOI10.1016/0020-0190(83)90112-6zbMath0529.68039OpenAlexW2021636211MaRDI QIDQ787676

Francis Y. L. Chin, Yung Hyang Tsin

Publication date: 1983

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(83)90112-6

zbMATH Keywords

parallel computationanalysis of algorithmsparallel algorithmsundirected graphbridgesoptimal algorithmssequential algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60) Algorithms in computer science (68W99)

Related Items (4)

FAST PARALLEL ALGORITHMS FOR FINDING CUTPOINTS AND BRIDGES OF UNDIRECTED GRAPHS ⋮ PARALLEL BLOCK-FINDING USING DISTANCE MATRICES ⋮ Yet another optimal algorithm for 3-edge-connectivity ⋮ AN EFFICIENT DISTRIBUTED ALGORITHM FOR 3-EDGE-CONNECTIVITY

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel concepts in graph theory
• A note on finding the bridges of a graph
• Fast, Efficient Parallel Algorithms for Some Graph Problems
• A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations

This page was built for publication: A general program scheme for finding bridges