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...

Celý popis

Podrobná bibliografia

Vydané v:	2012 26th IEEE International Parallel and Distributed Processing Symposium Workshops s. 2494 - 2497
Hlavní autori:	Azad, A., Pothen, A.
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.05.2012
Predmet:	Algorithm design and analysis Approximation algorithms Approximation methods Bipartite graph Flow cytometry Generalized edge cover Graph matching Multicore processing Program processors
ISBN:	1467309745, 9781467309745
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!