Prosenjit Bose, Albert Chan, Frank K. H. A. Dehne, Markus Latzel. Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs. In 13th International Parallel Processing Symposium / 10th Symposium on Parallel and Distributed Processing (IPPS / SPDP 99), 12-16 April 1999, San Juan, Puerto Rico, Proceedings. pages 125-129, IEEE Computer Society, 1999. [doi]
@inproceedings{BoseCDL99,
title = {Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs},
author = {Prosenjit Bose and Albert Chan and Frank K. H. A. Dehne and Markus Latzel},
year = {1999},
url = {http://computer.org/proceedings/ipps/0143/01430125abs.htm},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/BoseCDL99},
cites = {0},
citedby = {0},
pages = {125-129},
booktitle = {13th International Parallel Processing Symposium / 10th Symposium on Parallel and Distributed Processing (IPPS / SPDP 99), 12-16 April 1999, San Juan, Puerto Rico, Proceedings},
publisher = {IEEE Computer Society},
isbn = {0-7695-0143-5},
}