PARALLEL BLOCK-FINDING USING DISTANCE MATRICES
From MaRDI portal
Publication:4820161
DOI10.1080/10637199608915561zbMATH Open1049.68921OpenAlexW1994306308WikidataQ126249501 ScholiaQ126249501MaRDI QIDQ4820161FDOQ4820161
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel computation and conflicts in memory access
- Optimal bounds for decision problems on the CRCW PRAM
- An Efficient Parallel Biconnectivity Algorithm
- New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM
- An O(logn) parallel connectivity algorithm
- Parallel Matrix and Graph Algorithms
- Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
- Fast, Efficient Parallel Algorithms for Some Graph Problems
- Implementation of simultaneous memory address access in models that forbid it
- A general program scheme for finding bridges
- Optimal parallel algorithms for finding cut vertices and bridges of interval graphs
- FAST PARALLEL ALGORITHMS FOR FINDING CUTPOINTS AND BRIDGES OF UNDIRECTED GRAPHS
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)
