An efficient algorithm to construct disjoint path covers of DCell networks (Q897875)
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: An efficient algorithm to construct disjoint path covers of DCell networks |
scientific article; zbMATH DE number 6517438
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm to construct disjoint path covers of DCell networks |
scientific article; zbMATH DE number 6517438 |
Statements
An efficient algorithm to construct disjoint path covers of DCell networks (English)
0 references
8 December 2015
0 references
data center network
0 references
DCell network
0 references
disjoint path cover
0 references
Hamiltonian path
0 references
0 references
0 references
0.773320734500885
0 references
0.7548792362213135
0 references
0.7373988628387451
0 references
0.7300190925598145
0 references
