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). Piscataway, NJ, United States: Publ by IEEE.

Optimal parallel matching algorithms for a convex bipartite graph on a mesh-connected computer. / Kim, Myung Ho; Jeong, Chang-Sung; Kim, Myung Soo.

Proceedings of the International Conference on Parallel Processing. Piscataway, NJ, United States : Publ by IEEE, 1994. p. 229-233.

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

Kim, MH, Jeong, C-S & Kim, MS 1994, Optimal parallel matching algorithms for a convex bipartite graph on a mesh-connected computer. in Proceedings of the International Conference on Parallel Processing. Publ by IEEE, Piscataway, NJ, United States, pp. 229-233, Proceedings of the 8th International Parallel Processing Symposium, Cancun, Mex, 94/4/26.
Kim MH, Jeong C-S, Kim MS. Optimal parallel matching algorithms for a convex bipartite graph on a mesh-connected computer. In Proceedings of the International Conference on Parallel Processing. Piscataway, NJ, United States: Publ by IEEE. 1994. p. 229-233
Kim, Myung Ho ; Jeong, Chang-Sung ; Kim, Myung Soo. / Optimal parallel matching algorithms for a convex bipartite graph on a mesh-connected computer. Proceedings of the International Conference on Parallel Processing. Piscataway, NJ, United States : Publ by IEEE, 1994. pp. 229-233
@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 Chang-Sung Jeong and Kim, {Myung Soo}",
year = "1994",
month = "1",
day = "1",
language = "English",
isbn = "0818656026",
pages = "229--233",
booktitle = "Proceedings of the International Conference on Parallel Processing",
publisher = "Publ by IEEE",

}

TY - GEN

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

AU - Kim, Myung Ho

AU - Jeong, Chang-Sung

AU - Kim, Myung Soo

PY - 1994/1/1

Y1 - 1994/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0027961819&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027961819&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0027961819

SN - 0818656026

SP - 229

EP - 233

BT - Proceedings of the International Conference on Parallel Processing

PB - Publ by IEEE

CY - Piscataway, NJ, United States

ER -