Coarse Grained Parallel Algorithms For Graph Matching

Coarse Grained Parallel Algorithms For Graph Matching (2008)

Cached

Download Links

by Albert Chan , Frank Dehne , Prosenjit Bose , Markus Latzel

Citations:

BibTeX

@MISC{Chan08coarsegrained,
    author = {Albert Chan and Frank Dehne and Prosenjit Bose and Markus Latzel},
    title = {Coarse Grained Parallel Algorithms For Graph Matching },
    year = {2008}
}

Bookmark

OpenURL

Abstract

Citations

1016	A Bridging Model for Parallel Computation - Valiant - 1990
457	An n 5/2 algorithm for maximum matchings in bipartite graphs - Hopcroft, Karp - 1973
157	Direct bulk-synchronous parallel algorithms - Gerbessiotis, Valiant - 1992
139	Synthesis of Parallel Algorithms - Reif - 1993
83	Parallel Programming: Techniques and Applications Using Networked Workstations and Parallel Computers - Wilkinson, Allen - 1999
76	Scalable parallel computational geometry for coarse grained multicomputers - Dehne, Fabri, et al. - 1996
62	Type architectures, shared memory and the corollary of modest potential - Snyder - 1986
55	Roncato Efficient parallel graph algorithms for coarse-grained multicomputers and BSP - Dehne, Ferreira, et al.
49	A randomized parallel 3D convex hull algorithm for coarse grained multicomputers - Dehne, Deng, et al.
33	Sublinear-time parallel algorithms for matching and related problems - Goldberg, Plotkin, et al. - 1993
31	Scalable and Architecture Independent Parallel Geometric Algorithms with High Probability Optimal Time - Dehne, Fabri, et al. - 1994
25	Fast parallel algorithms for graph matching problems - Karpinski, Rytter - 1998
23	A Comparison of Shared and Nonshared Memory Models of Computation - Anderson, Snyder
23	Efficient parallel algorithms for chordal graphs, in - Klein - 1989
20	Efficient Parallel Algorithms for Planar - Klein - 1988
14	CGMgraph/CGMlib: implementing and testing CGM graph algorithms on PC clusters - Chan, Dehne
14	Communication efficient parallel sorting - Goodrich - 1996
13	Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems, Acta Informatica 15 - Lipski, Preparata - 1981
10	A note on coarse grained parallel integer sorting - Chan, Dehne - 1999
9	A parallel matching algorithm for convex bipartite graphs and applications to scheduling - Dekel, Sahni - 1984
6	Coarse grained parallel maximum matching in convex bipartite graphs - Bose, Chan, et al. - 1999
6	hnson, A parallel algorithm for maximum matching on interval graphs - Moitra, Jo - 1989
5	An optimal parallel algorithm for maximal matching - Kelsen - 1994
4	Guest editor’s introduction: special issue on coarse grained parallel algorithms for scientific applications, Algorithmica 45 (3 - Dehne - 2006
4	Fast parallel matching in expander graphs, in - Kelsen - 1993
4	Efficient parallel algorithms for planar, chordal, and interval graphs - Klein - 1988
4	Parallel algorithm for maximum weight matching in trees - Pawagi - 1987
4	Parallel algorithms for chordal graphs, in: Synthesis of Parallel Algorithms - Klein - 1993
3	Parallel construction of perfect matchings and hamiltonian cycles on dense graphs - Dalhaus, Karpinski - 1987
3	Fast parallel algorithms for bipartite matching, in - Grover - 1992
3	et al., General purpose parallel architectures - Valiant - 1990
2	On the Computational Complexity of Matching on Chordal and Strongly Chordal Graphs - Dahlhaus, Karpinski - 1994
2	An efficient distributed algorithm for maximum matching in general graphs, Algorithmica 5 - Wu, Loui - 1990
1	Parallel algorithms for maximum matching in interval graphs - Andrews, Atallah, et al. - 1995
1	A coarse grained parallel algorithm for maximum weight matching in trees - Chan, Dehne
1	Maximum matching in convex bipartite graphs, Naval Research Logistics Quarterly 14 - Clover - 1967
1	On the parallel complexity of matching for chordal and path graphs - Dahlhaus, Karpinski - 1987
1	Parallel Complexity for Matching Restricted to Degree Defined Graph Classes - Dahlhaus, Karpinski - 1987
1	The Parallel and Sequential Complexity of Matching on Chordal and Strongly Chordal Graphs - Dahlhaus, Karpinski - 1995
1	Andrzej Lingas, A Parallel Algorithm for Maximum Matching in Planar Graphs - Dahlhaus, Karpinski - 1989
1	Andrzej Lingas, Nearly Optimal Parallel Algorithm for Maximum Matching - Kao, Karpinski - 1990
1	An optimal parallel matching algorithm for a convex bipartite graph on a mesh-connected computer - Kim, Jeong, et al. - 1994
1	Parallel Algorithms for Chordal Graphs, pages 341–407. Synthesis of Parallel Algorithms - Klein - 1993
1	Parallel organization algorithm for graph matching and subgraph isomorphism detection, in: Setsuo Arikawa, Hiroshi Motoda (Eds - Nakanishi, Uehara - 1998
1	On the Parallel Complexity of Matching for Chordal and - Dahlhaus, Karpinski - 1987
1	Wojciech Rytter, Fast parallel algorithms for graph matching problems - Karpinski - 1998