The shortest path problem in the Knödel graph (Q2018539)
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 shortest path problem in the Knödel graph |
scientific article; zbMATH DE number 6419168
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The shortest path problem in the Knödel graph |
scientific article; zbMATH DE number 6419168 |
Statements
The shortest path problem in the Knödel graph (English)
0 references
24 March 2015
0 references
Knödel graph
0 references
shortest path problem
0 references
diameter of the Knödel graph
0 references
0.8987579345703125
0 references
0.8860293626785278
0 references
0.8557407259941101
0 references
0.7776547074317932
0 references
0.7629448771476746
0 references
