An efficient algorithm for the \(k\)-pairwise disjoint paths problem in hypercubes (Q1579747): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jpdc.2000.1632 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1968025843 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:33, 20 March 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
