Published in
Proceedings of the first workshop on Irregular applications: architectures and algorithm - IAAA '11
Links
Tools
Computing maximum matching in parallel on bipartite graphs: worth the effort?
Proceedings article published in 2011 by
Ariful Azad 
,
Mahantesh Halappanavar,
Florin Dobrian,
Alex Pothen
,
Mahantesh Halappanavar,
Florin Dobrian,
Alex Pothen
This paper was not found in any repository, but could be made available legally by the author.
Full text: Unavailable
Published version:
archiving forbidden
Data provided by 