An efficient parallel algorithm for finding minimum weight matching for points on a convex polygon
From MaRDI portal
(Redirected from Publication:750155)
Recommendations
- An EP Algorithm for Computing a Minimum Weight Perfect Matching for a Set of Points on the Plane
- A lower bound for approximating the geometric minimum weight matching
- Fast Matching Algorithms for Points on a Polygon
- A generalized hypergreedy algorithm for weighted perfect matching
- Computing Minimum-Weight Perfect Matchings
Cites work
- scientific article; zbMATH DE number 432842 (Why is no real title available?)
- scientific article; zbMATH DE number 1142306 (Why is no real title available?)
- Fast Matching Algorithms for Points on a Polygon
- Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm
- Searching, Merging, and Sorting in Parallel Computation
Cited in
(6)- A parallel algorithm for finding congruent regions
- scientific article; zbMATH DE number 1496856 (Why is no real title available?)
- Faster bottleneck non-crossing matchings of points in convex position
- A parallel algorithm for the conductor of a point set
- An EP Algorithm for Computing a Minimum Weight Perfect Matching for a Set of Points on the Plane
- Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm
This page was built for publication: An efficient parallel algorithm for finding minimum weight matching for points on a convex polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q750155)
