An efficient algorithm for the \(k\)-pairwise disjoint paths problem in hypercubes (Q1579747): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:51, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for the \(k\)-pairwise disjoint paths problem in hypercubes |
scientific article |
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
