Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs (Q2338215)
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 7134466
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs |
scientific article; zbMATH DE number 7134466 |
Statements
Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs (English)
0 references
21 November 2019
0 references
Gabriel graphs
0 references
Euclidean bottleneck matchings
0 references
Euclidean Hamiltonian cycles
0 references
computational geometry
0 references
0 references
0.9063069820404052
0 references
0.8236234784126282
0 references
0.7757487893104553
0 references
0.7650054693222046
0 references
0.7577880620956421
0 references
