An efficient algorithm to construct disjoint path covers of DCell networks (Q897875): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q60402100, #quickstatements; #temporary_batch_1707303357582 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q60402100 / rank | |||
Normal rank | |||
Revision as of 14:07, 7 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm to construct disjoint path covers of DCell networks |
scientific article |
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
