PARALLEL BLOCK-FINDING USING DISTANCE MATRICES

DOI10.1080/10637199608915561MaRDI QIDQ4820161zbMATH OpenOpenAlexWikidataFDO

Authors 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

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

This page was built for publication: PARALLEL BLOCK-FINDING USING DISTANCE MATRICES

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