An efficient construction of one-to-many node-disjoint paths in folded hypercubes (Q2443019)
From MaRDI portal
!
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 6277326
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient construction of one-to-many node-disjoint paths in folded hypercubes |
scientific article; zbMATH DE number 6277326 |
Statements
An efficient construction of one-to-many node-disjoint paths in folded hypercubes (English)
0 references
2 April 2014
0 references
hypercube
0 references
folded hypercube
0 references
node-disjoint paths
0 references
matching problem
0 references
optimization problem
0 references
0 references
0 references
0.7865017652511597
0 references
0.7776058316230774
0 references
0.7737861275672913
0 references
0.7717288732528687
0 references
