Two conditions for reducing the maximal length of node-disjoint paths in hypercubes (Q764341): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2011.11.009 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2037249467 / rank | |||
Normal rank | |||
Revision as of 02:15, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two conditions for reducing the maximal length of node-disjoint paths in hypercubes |
scientific article |
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
