Optimal parallel matching algorithms for a convex bipartite graph on a mesh-connected computer

Myung Ho Kim, Chang-Sung Jeong, Myung Soo Kim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings of the International Conference on Parallel Processing
Place of PublicationPiscataway, NJ, United States
PublisherPubl by IEEE
Pages229-233
Number of pages5
ISBN (Print)0818656026
Publication statusPublished - 1994 Jan 1
Externally publishedYes
EventProceedings of the 8th International Parallel Processing Symposium - Cancun, Mex
Duration: 1994 Apr 261994 Apr 29

Other

OtherProceedings of the 8th International Parallel Processing Symposium
CityCancun, Mex
Period94/4/2694/4/29

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Kim, M. H., Jeong, C-S., & Kim, M. S. (1994). Optimal parallel matching algorithms for a convex bipartite graph on a mesh-connected computer. In Proceedings of the International Conference on Parallel Processing (pp. 229-233). Publ by IEEE.