Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs

Authors:
P. Bose;Albert Chan;Frank K. H. A. Dehne;M. Latzel
Affiliations:
-;-;-;-
Venue:
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
Year:
1999

Citing 0
Cited 4

Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs

WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Coarse grained parallel algorithms for graph matching

Parallel Computing
A coarse-grained multicomputer algorithm for the longest repeated suffix ending at each point in a word

ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartII
A CGM algorithm solving the longest increasing subsequence problem

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = (A; B; E).For p processors with N=p memory per processor, N = jAj +jBj, N=p = p, the algorithm requires O(log p) communication rounds and O(Tsequ( n p ; m p ) + n p log p) local computation, where n = jAj, m = jBj and Tsequ(n; m) is the sequential time complexity for the problem. For the BSP model, this implies O(log p) supersteps with O(gN + g n p log p) communication cost and O(Tsequ( n p ; m p ) + n p log p) local computation.