Efficient randomized incremental algorithm for the closest pair problem using Leafary trees (Q6064016): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bfb0030821 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1596775411 / rank | |||
Normal rank | |||
Revision as of 11:17, 30 July 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
