Coarse grained parallel algorithms for graph matching-Reference-Cited by-同舟云学术

Coarse grained parallel algorithms for graph matching

Published:2008-01 Issue:1 Volume:34 Page:47-62
ISSN:0167-8191
Container-title:Parallel Computing
language:en
Short-container-title:Parallel Computing

Author:

Chan Albert,Dehne Frank,Bose Prosenjit,Latzel Markus

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Graphics and Computer-Aided Design,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference46 articles.

1. Parallel Programming – Techniques and Applications using Networked Workstations and Parallel Computers;Allen,1999

2. A comparison of shared and nonshared memory models of computation;Anderson;IEEE,1993

3. Parallel algorithms for maximum matching in interval graphs;Andrews,1995

4. P. Bose, A. Chan, F. Dehne, M. Latzel, Coarse grained parallel maximum matching in convex bipartite graphs, in: Proceedings of the 13th International Parallel Processing Symposium (IPPS’99), 1999, pp. 125–129.

5. Efficient parallel graph algorithms for coarse grained multicomputers and bsp;Cáceres,1997

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs;Theoretical Computer Science;2020-01

2. Parallelization of Graph Partitioning;Graph Partitioning;2013-02-13

3. Scotch and PT-Scotch Graph Partitioning Software;Combinatorial Scientific Computing;2012-01-25

4. Linear-Time Algorithm for the Paired-Domination Problem in Convex Bipartite Graphs;Theory of Computing Systems;2011-12-03

5. Scalable Node-Level Computation Kernels for Parallel Exact Inference;IEEE Transactions on Computers;2010-01