Efficient randomized incremental algorithm for the closest pair problem using Leafary trees (Q6064016): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/bfb0030821 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/BFB0030821 / rank | |||
Normal rank | |||
Latest revision as of 19:05, 30 December 2024
scientific article; zbMATH DE number 7776433
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient randomized incremental algorithm for the closest pair problem using Leafary trees |
scientific article; zbMATH DE number 7776433 |
Statements
Efficient randomized incremental algorithm for the closest pair problem using Leafary trees (English)
0 references
12 December 2023
0 references
