Bipartite graph matching for points on a line or a circle

Michael Werman; Shmuel Peleg; Robert Melter; T. Y. Kong

doi:10.1016/0196-6774(86)90009-X

Bipartite graph matching for points on a line or a circle

Michael Werman^*, Shmuel Peleg, Robert Melter, T. Y. Kong

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

33 Scopus citations

Abstract

Given two sets of M points on a line or on a circle, a minimal matching between them is found in O(M log M) time. The circular case, where the distance between two points is the length of the shortest arc connecting them, is shown to have the same complexity as the simpler linear case. Finding the shift of one of the sets, linear or circular, that minimizes the cost of matching is also discussed.

Original language	English
Pages (from-to)	277-284
Number of pages	8
Journal	Journal of Algorithms
Volume	7
Issue number	2
DOIs	https://doi.org/10.1016/0196-6774(86)90009-X
State	Published - Jun 1986
Externally published	Yes

Bibliographical note

Funding Information:
*Permanent address: Dept. of Computer Science, The Hebrew University of Jerusalem, 91904 Jerusalem, Israel. These authors were supported in Israel by a grant from the Bergman Foundation. +Permanent address: Dept of Mathematics, Long Island University, Southampton, NY 11968. *Permanent address: Programming Research Group, Oxford University Computing Laboratory, England.

Funding Information:
Science Foundation under Grant DCR-82-18408 Janet Salzman in preparing this paper.

Access to Document

10.1016/0196-6774(86)90009-X

Cite this

@article{c9c0a5b7a2d240af95ef6292a289c96a,

title = "Bipartite graph matching for points on a line or a circle",

abstract = "Given two sets of M points on a line or on a circle, a minimal matching between them is found in O(M log M) time. The circular case, where the distance between two points is the length of the shortest arc connecting them, is shown to have the same complexity as the simpler linear case. Finding the shift of one of the sets, linear or circular, that minimizes the cost of matching is also discussed.",

author = "Michael Werman and Shmuel Peleg and Robert Melter and Kong, {T. Y.}",

note = "Funding Information: *Permanent address: Dept. of Computer Science, The Hebrew University of Jerusalem, 91904 Jerusalem, Israel. These authors were supported in Israel by a grant from the Bergman Foundation. +Permanent address: Dept of Mathematics, Long Island University, Southampton, NY 11968. *Permanent address: Programming Research Group, Oxford University Computing Laboratory, England. Funding Information: Science Foundation under Grant DCR-82-18408 Janet Salzman in preparing this paper.",

year = "1986",

month = jun,

doi = "10.1016/0196-6774(86)90009-X",

language = "אנגלית",

volume = "7",

pages = "277--284",

journal = "Journal of Algorithms",

issn = "0196-6774",

publisher = "Academic Press Inc.",

number = "2",

}

TY - JOUR

T1 - Bipartite graph matching for points on a line or a circle

AU - Werman, Michael

AU - Peleg, Shmuel

AU - Melter, Robert

AU - Kong, T. Y.

N1 - Funding Information: *Permanent address: Dept. of Computer Science, The Hebrew University of Jerusalem, 91904 Jerusalem, Israel. These authors were supported in Israel by a grant from the Bergman Foundation. +Permanent address: Dept of Mathematics, Long Island University, Southampton, NY 11968. *Permanent address: Programming Research Group, Oxford University Computing Laboratory, England. Funding Information: Science Foundation under Grant DCR-82-18408 Janet Salzman in preparing this paper.

PY - 1986/6

Y1 - 1986/6

N2 - Given two sets of M points on a line or on a circle, a minimal matching between them is found in O(M log M) time. The circular case, where the distance between two points is the length of the shortest arc connecting them, is shown to have the same complexity as the simpler linear case. Finding the shift of one of the sets, linear or circular, that minimizes the cost of matching is also discussed.

AB - Given two sets of M points on a line or on a circle, a minimal matching between them is found in O(M log M) time. The circular case, where the distance between two points is the length of the shortest arc connecting them, is shown to have the same complexity as the simpler linear case. Finding the shift of one of the sets, linear or circular, that minimizes the cost of matching is also discussed.

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

U2 - 10.1016/0196-6774(86)90009-X

DO - 10.1016/0196-6774(86)90009-X

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:38249039104

SN - 0196-6774

VL - 7

SP - 277

EP - 284

JO - Journal of Algorithms

JF - Journal of Algorithms

IS - 2

ER -

Bipartite graph matching for points on a line or a circle

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this