PARALLEL BLOCK-FINDING USING DISTANCE MATRICES

DOI10.1080/10637199608915561zbMath1049.68921OpenAlexW1994306308WikidataQ126249501 ScholiaQ126249501MaRDI QIDQ4820161

Stavros D. Nikolopoulos

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/10637199608915561

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites Work

• Unnamed Item
• Unnamed Item
• A general program scheme for finding bridges
• Parallel computation and conflicts in memory access
• Optimal parallel algorithms for finding cut vertices and bridges of interval graphs
• Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
• An Efficient Parallel Biconnectivity Algorithm
• New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM
• Parallel Matrix and Graph Algorithms
• Fast, Efficient Parallel Algorithms for Some Graph Problems
• An O(logn) parallel connectivity algorithm
• Optimal bounds for decision problems on the CRCW PRAM
• Implementation of simultaneous memory address access in models that forbid it
• FAST PARALLEL ALGORITHMS FOR FINDING CUTPOINTS AND BRIDGES OF UNDIRECTED GRAPHS