A divide-and-conquer algorithm for min-cost perfect matching in the plane (Q6909489)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8112186
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A divide-and-conquer algorithm for min-cost perfect matching in the plane |
scientific article; zbMATH DE number 8112186 |
Statements
A divide-and-conquer algorithm for min-cost perfect matching in the plane (English)
0 references
29 October 2025
0 references
