Type architectures, shared memory, and the corollary of modest potential
Annual review of computer science vol. 1, 1986
A bridging model for parallel computation
Communications of the ACM
General purpose parallel architectures
Handbook of theoretical computer science (vol. A)
Sublinear-time parallel algorithms for matching and related problems
Journal of Algorithms
Scalable parallel geometric algorithms for coarse grained multicomputers
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Fast parallel matching in expander graphs
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
An optimal parallel algorithm for maximal matching
Information Processing Letters
A randomized parallel 3D convex hull algorithm for coarse grained multicomputers
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Communication-efficient parallel sorting (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Fast parallel algorithms for graph matching problems
Fast parallel algorithms for graph matching problems
Parallel programming: techniques and applications using networked workstations and parallel computers
Synthesis of Parallel Algorithms
Synthesis of Parallel Algorithms
Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
An Optimal Parallel Matching Algorithm for a Convex Bipartite Graph on a Mesh-Connected Computer
Proceedings of the 8th International Symposium on Parallel Processing
Parallel algorithms for maximum matching in interval graphs
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Direct Bulk-Synchronous Parallel Algorithms
SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Parallel Algorithms for Chordal Graphs
Parallel Algorithms for Chordal Graphs
On the Parallel Complexity of Matching for Chordal and Path Graphs
On the Parallel Complexity of Matching for Chordal and Path Graphs
The Parallel and Sequential Complexity of Matching on Chordal and Strongly Chordal Graphs
The Parallel and Sequential Complexity of Matching on Chordal and Strongly Chordal Graphs
Parallel Construction of Perfect Matchings and Hamiltonian Cycles on Dense Graphs
Parallel Construction of Perfect Matchings and Hamiltonian Cycles on Dense Graphs
A Parallel Algorithm for Maximum Matching in Planar Graphs
A Parallel Algorithm for Maximum Matching in Planar Graphs
Nearly Optimal Parallel Algorithm for Maximum Matching in Planar Graphs
Nearly Optimal Parallel Algorithm for Maximum Matching in Planar Graphs
Parallel Complexity of Matching Restricted to Degree-Defined Graph Classes
Parallel Complexity of Matching Restricted to Degree-Defined Graph Classes
Algorithmica
SPDP '94 Proceedings of the 1994 6th IEEE Symposium on Parallel and Distributed Processing
Hi-index | 0.00 |
Parallel graph algorithm design is a very well studied topic. Many results have been presented for the PRAM model. However, these algorithms are inherently fine grained and experiments show that PRAM algorithms do often not achieve the expected speedup on real machines because of large message overheads. In this paper, we present coarse grained parallel graph algorithms with small message overheads that solve the following standard graph problems related to graph matching: finding maximum matchings in convex bipartite graphs, and finding maximum weight matchings in trees. To our knowledge, these are the first efficient parallel algorithms for these problems that are designed for standard commercial parallel machines such as off-the-shelf processor clusters.