A sparse graph almost as good as the complete graph on points in \(k\) dimensions (Q1814131): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Delaunay graphs are almost as good as complete graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Quad trees: A data structure for retrieval by composite keys / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3992847 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4144192 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An O(n log n) algorithm for the all-nearest-neighbors problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximate minimum weight matching on points in k-dimensional space / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Constructing Minimum Spanning Trees in <i>k</i>-Dimensional Spaces and Related Problems / rank | |||
Normal rank | |||
Latest revision as of 09:35, 15 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sparse graph almost as good as the complete graph on points in \(k\) dimensions |
scientific article |
Statements
A sparse graph almost as good as the complete graph on points in \(k\) dimensions (English)
0 references
25 June 1992
0 references
sparse graph
0 references
complete graph
0 references
distance
0 references
error parameter
0 references
shortest path
0 references
