Constructing the nearly shortest path in crossed cubes (Q2390375)
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: Constructing the nearly shortest path in crossed cubes |
scientific article; zbMATH DE number 5581879
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constructing the nearly shortest path in crossed cubes |
scientific article; zbMATH DE number 5581879 |
Statements
Constructing the nearly shortest path in crossed cubes (English)
0 references
22 July 2009
0 references
interconnection networks
0 references
crossed cubes
0 references
nearly shortest path
0 references
second shortest path
0 references
path embedding
0 references
0.8158866167068481
0 references
0.81441330909729
0 references
0.7933403849601746
0 references
0.777309775352478
0 references
0.7739049792289734
0 references
