FAST PARALLEL ALGORITHMS FOR FINDING CUTPOINTS AND BRIDGES OF UNDIRECTED GRAPHS

DOI10.1080/10637199408962525MaRDI QIDQ4820006zbMATHOpenAlexFDO

Authors Stavros D. Nikolopoulos, Stylianos D. Danielopoulos

Publication date 6 October 2004

Published in Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10637199408962525

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Cites work

• scientific article; zbMATH DE number 107950 (Why is no real title available?)
• A general program scheme for finding bridges
• An Efficient Parallel Biconnectivity Algorithm
• An O(logn) parallel connectivity algorithm
• Fast parallel graph searching with applications
• Fast, Efficient Parallel Algorithms for Some Graph Problems
• Implementation of simultaneous memory address access in models that forbid it
• Parallel computation and conflicts in memory access

Cited in

(1)

• PARALLEL BLOCK-FINDING USING DISTANCE MATRICES

This page was built for publication: FAST PARALLEL ALGORITHMS FOR FINDING CUTPOINTS AND BRIDGES OF UNDIRECTED GRAPHS

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