An efficient parallel algorithm for finding minimum weight matching for points on a convex polygon
type: Item
instance of: scholarly article
title: An efficient parallel algorithm for finding minimum weight matching for points on a convex polygon
zbMATH Open document ID: 0713.68029
DOI: 10.1016/0020-0190(91)90143-6
author: Xin He
published in: Information Processing Letters
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 4174328
zbMATH Keywords: optimization
zbMATH Keywords: parallel algorithm
zbMATH Keywords: convex polygon
MaRDI profile type: Publication
full work available at URL: 0020-0190(91)90143-6
OpenAlex ID: W2000080814
cites work: Q3138976
cites work: Q4385522
cites work: Searching, Merging, and Sorting in Parallel Computation
cites work: Fast Matching Algorithms for Points on a Polygon
cites work: Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm
description: scientific article; zbMATH DE number 4174328