On the minimum path problem in Knödel graphs (Q3593374)
From MaRDI portal
!
WARNING
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 5173300
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the minimum path problem in Knödel graphs |
scientific article; zbMATH DE number 5173300 |
Statements
On the minimum path problem in Knödel graphs (English)
0 references
20 July 2007
0 references
interconnection network
0 references
Knödel graph
0 references
shortest path
0 references
approximation algorithm
0 references
0.8860293626785278
0 references
0.8262450695037842
0 references
0.8160816431045532
0 references
0.7860900163650513
0 references
0.7738049030303955
0 references
