An efficient algorithm for \(k\)-pairwise disjoint paths in star graphs (Q293380)
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: An efficient algorithm for k-pairwise disjoint paths in star graphs |
scientific article; zbMATH DE number 6590762
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm for \(k\)-pairwise disjoint paths in star graphs |
scientific article; zbMATH DE number 6590762 |
Statements
An efficient algorithm for \(k\)-pairwise disjoint paths in star graphs (English)
0 references
9 June 2016
0 references
disjoint paths
0 references
interconnection networks
0 references
off-line routing algorithm
0 references
0.896815836429596
0 references
0.8846155405044556
0 references
0.8375937938690186
0 references
