Two conditions for reducing the maximal length of node-disjoint paths in hypercubes (Q764341)
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: Two conditions for reducing the maximal length of node-disjoint paths in hypercubes |
scientific article; zbMATH DE number 6014325
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two conditions for reducing the maximal length of node-disjoint paths in hypercubes |
scientific article; zbMATH DE number 6014325 |
Statements
Two conditions for reducing the maximal length of node-disjoint paths in hypercubes (English)
0 references
13 March 2012
0 references
hypercube
0 references
node-disjoint paths
0 references
matching
0 references
optimization problem
0 references
0 references
0.8444097638130188
0 references
0.8328697681427002
0 references
0.8283293843269348
0 references
