An efficient algorithm for the \(k\)-pairwise disjoint paths problem in hypercubes (Q1579747)
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 1507032
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm for the \(k\)-pairwise disjoint paths problem in hypercubes |
scientific article; zbMATH DE number 1507032 |
Statements
An efficient algorithm for the \(k\)-pairwise disjoint paths problem in hypercubes (English)
0 references
8 February 2001
0 references
hypercubes
0 references
node-disjoint paths
0 references
interconnection topologies
0 references
0.8792548775672913
0 references
0.8603989481925964
0 references
0.8406158089637756
0 references
