𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Coarse grained parallel algorithms for graph matching

✍ Scribed by Albert Chan; Frank Dehne; Prosenjit Bose; Markus Latzel

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
236 KB
Volume
34
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Deterministic parallel selection algorit
Deterministic parallel selection algorithms on coarse-grained multicomputers
✍ M. Cafaro; Vincenzo De Bene; G. Aloisio πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 351 KB

## Abstract We present two deterministic parallel Selection algorithms for distributed memory machines, under the coarse‐grained multicomputer model. Both are based on the use of two weighted 3‐medians, that allows discarding at least 1/3 of the elements in each iteration. The first algorithm sligh

C3: A Parallel Model for Coarse-Grained
C3: A Parallel Model for Coarse-Grained Machines
✍ Susanne E. Hambrusch; Ashfaq A. Khokhar πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 608 KB

In this paper, we propose a model for parallel computation, the C 3 -model. The C 3 -model evaluates, for a given parallel algorithm and target architecture, the complexity of computation, the pattern of communication, and the potential congestion arising during communication. A metric for estimatin

An Efficient Parallel Algorithm for Maxi
An Efficient Parallel Algorithm for Maximum Matching for Some Classes of Graphs
✍ I. Parfenoff πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 403 KB

The P 4 -tidy graphs were introduced by I. Rusu to generalize some already known classes of graphs with few induced P 4 (cographs, P 4 -sparse graphs, P 4 -lite graphs). Here, we propose an extension of R. Lin and S. Olariu's work (1994. J. Parallel Distributed Computing 22, 26 36.) on cographs, usi