An efficient construction of one-to-many node-disjoint paths in folded hypercubes (Q2443019)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient construction of one-to-many node-disjoint paths in folded hypercubes |
scientific article |
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
