An efficient parallel algorithm for finding minimum weight matching for points on a convex polygon

Authors:
Xin He
Affiliations:
-
Venue:
Information Processing Letters
Year:
1991

Citing 0
Cited 1

Linear and O(n log n) time minimum-cost matching algorithms for quasi-convex tours

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	0.89

Visualization

Abstract