Multithreaded Algorithms for Matching in Graphs with Application to Data Analysis in Flow Cytometry

We study parallel algorithms for computing matchings in graphs and apply them to solve population registration problem from bio-imaging data. We have developed several classes of multithreaded algorithms for maximum cardinality matching and achieved good speedups on three shared memory machines on a...

Full description

Bibliographic Details

Published in:	2012 26th IEEE International Parallel and Distributed Processing Symposium Workshops pp. 2494 - 2497
Main Authors:	Azad, A., Pothen, A.
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.05.2012
Subjects:	Algorithm design and analysis Approximation algorithms Approximation methods Bipartite graph Flow cytometry Generalized edge cover Graph matching Multicore processing Program processors
ISBN:	1467309745, 9781467309745
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!