Pairwise edge disjoint shortest paths in the \(n\)-cube (Q861284)
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: Pairwise edge disjoint shortest paths in the n-cube |
scientific article; zbMATH DE number 5083802
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Pairwise edge disjoint shortest paths in the \(n\)-cube |
scientific article; zbMATH DE number 5083802 |
Statements
Pairwise edge disjoint shortest paths in the \(n\)-cube (English)
0 references
9 January 2007
0 references
hypercube
0 references
\(n\)-cube
0 references
edge disjoint shortest paths
0 references
\(NP\)-completeness
0 references
0.835270881652832
0 references
0.819061279296875
0 references
0.814075767993927
0 references
