@inproceedings{54adf5c83351455fa51f74463317b89a,
title = "Optimal parallel matching algorithms for a convex bipartite graph on a mesh-connected computer",
abstract = "In this paper, we address the problem of finding a maximum matching for a convex bipartite graph on a mesh-connected computer (MCC). We shall show that this can be done in optimal time on MCC by designing the efficient merge and division schemes in bottom-up and top-down approach respectively.",
author = "Kim, {Myung Ho} and Jeong, {Chang Sung} and Kim, {Myung Soo}",
year = "1994",
language = "English",
isbn = "0818656026",
series = "Proceedings of the International Conference on Parallel Processing",
publisher = "Publ by IEEE",
pages = "229--233",
booktitle = "Proceedings of the International Conference on Parallel Processing",
note = "Proceedings of the 8th International Parallel Processing Symposium ; Conference date: 26-04-1994 Through 29-04-1994",
}