The \(K\)-discretization and \(K\)-incident graphs for discretizable distance geometry (Q2174889)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The K-discretization and K-incident graphs for discretizable distance geometry |
scientific article; zbMATH DE number 7193667
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The \(K\)-discretization and \(K\)-incident graphs for discretizable distance geometry |
scientific article; zbMATH DE number 7193667 |
Statements
The \(K\)-discretization and \(K\)-incident graphs for discretizable distance geometry (English)
0 references
27 April 2020
0 references
distance geometry
0 references
vertex orders
0 references
discretization
0 references
combinatorial optimization
0 references
0 references
0 references
0.8417037129402161
0 references
0.8414444327354431
0 references
0.8390297889709473
0 references
0.830544650554657
0 references
