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 journalArticlepeer-review

33 Scopus citations


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 languageAmerican English
Pages (from-to)277-284
Number of pages8
JournalJournal of Algorithms
Issue number2
StatePublished - Jun 1986
Externally publishedYes

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.


Dive into the research topics of 'Bipartite graph matching for points on a line or a circle'. Together they form a unique fingerprint.

Cite this