Inproceedings,
Computing maximum matching in parallel on bipartite graphs: worth the effort?
A. Azad, M. Halappanavar, F. Dobrian, and A. Pothen.IA3@SC, page 11-14. ACM, (2011)
Meta data
- BibTeX key
- conf/sc/AzadHDP11
- entry type
- inproceedings
- booktitle
- IA3@SC
- year
- 2011
- pages
- 11-14
- publisher
- ACM
- crossref
- conf/sc/2011ia3
- ee
- https://doi.org/10.1145/2089142.2089147
- isbn
- 978-1-4503-1121-2
- url
- http://dblp.uni-trier.de/db/conf/sc/ia3-2011.html#AzadHDP11
Tags
Users
Comments and Reviewsshow / hide
Cite this publication
More citation styles
- please select -%0 Conference Paper
%1 conf/sc/AzadHDP11
%A Azad, Ariful
%A Halappanavar, Mahantesh
%A Dobrian, Florin
%A Pothen, Alex
%B IA3@SC
%D 2011
%E Feo, John
%E Villa, Oreste
%E Tumeo, Antonino
%E Secchi, Simone
%I ACM
%K dblp
%P 11-14
%T Computing maximum matching in parallel on bipartite graphs: worth the effort?
%U http://dblp.uni-trier.de/db/conf/sc/ia3-2011.html#AzadHDP11
%@ 978-1-4503-1121-2
@inproceedings{conf/sc/AzadHDP11,
added-at = {2018-11-06T00:00:00.000+0100},
author = {Azad, Ariful and Halappanavar, Mahantesh and Dobrian, Florin and Pothen, Alex},
biburl = {https://www.bibsonomy.org/bibtex/2adb3d0a6945a49c2fbca7dd8f4d7a8e2/dblp},
booktitle = {IA3@SC},
crossref = {conf/sc/2011ia3},
editor = {Feo, John and Villa, Oreste and Tumeo, Antonino and Secchi, Simone},
ee = {https://doi.org/10.1145/2089142.2089147},
interhash = {aa841f6d39e914f3e6c3a2e8739636aa},
intrahash = {adb3d0a6945a49c2fbca7dd8f4d7a8e2},
isbn = {978-1-4503-1121-2},
keywords = {dblp},
pages = {11-14},
publisher = {ACM},
timestamp = {2018-11-07T16:32:17.000+0100},
title = {Computing maximum matching in parallel on bipartite graphs: worth the effort?},
url = {http://dblp.uni-trier.de/db/conf/sc/ia3-2011.html#AzadHDP11},
year = 2011
}