An optimal parallel matching algorithm for a convex bipartite graph on a mesh-connected computer*

Myung Ho Kim, Chang-Sung Jeong

Research output: Contribution to journalArticle

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
Pages (from-to)129-141
Number of pages13
JournalParallel Algorithms and Applications
Volume6
Issue number2-3
DOIs
Publication statusPublished - 1995 Jan 1

Keywords

  • Convex bipartite graph
  • Distributed memory model
  • Maximum matching
  • Mesh-connected computer
  • Parallel algorithm

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

An optimal parallel matching algorithm for a convex bipartite graph on a mesh-connected computer*. / Kim, Myung Ho; Jeong, Chang-Sung.

In: Parallel Algorithms and Applications, Vol. 6, No. 2-3, 01.01.1995, p. 129-141.

Research output: Contribution to journalArticle

@article{677139c5d4f94997a09d4ebc36120f74,
title = "An optimal parallel matching algorithm 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.",
keywords = "Convex bipartite graph, Distributed memory model, Maximum matching, Mesh-connected computer, Parallel algorithm",
author = "Kim, {Myung Ho} and Chang-Sung Jeong",
year = "1995",
month = "1",
day = "1",
doi = "10.1080/10637199508915505",
language = "English",
volume = "6",
pages = "129--141",
journal = "International Journal of Parallel, Emergent and Distributed Systems",
issn = "1744-5760",
publisher = "Taylor and Francis Ltd.",
number = "2-3",

}

TY - JOUR

T1 - An optimal parallel matching algorithm for a convex bipartite graph on a mesh-connected computer*

AU - Kim, Myung Ho

AU - Jeong, Chang-Sung

PY - 1995/1/1

Y1 - 1995/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.

KW - Convex bipartite graph

KW - Distributed memory model

KW - Maximum matching

KW - Mesh-connected computer

KW - Parallel algorithm

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

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

U2 - 10.1080/10637199508915505

DO - 10.1080/10637199508915505

M3 - Article

AN - SCOPUS:84948866777

VL - 6

SP - 129

EP - 141

JO - International Journal of Parallel, Emergent and Distributed Systems

JF - International Journal of Parallel, Emergent and Distributed Systems

SN - 1744-5760

IS - 2-3

ER -