On the construction of all shortest node-disjoint paths in star networks (Q903371)
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: On the construction of all shortest node-disjoint paths in star networks |
scientific article; zbMATH DE number 6526582
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the construction of all shortest node-disjoint paths in star networks |
scientific article; zbMATH DE number 6526582 |
Statements
On the construction of all shortest node-disjoint paths in star networks (English)
0 references
5 January 2016
0 references
star network
0 references
node-disjoint paths
0 references
maximum matching
0 references
optimization problem
0 references
interconnection networks
0 references
0 references
0.8831353783607483
0 references
0.8487674593925476
0 references
0.8349327445030212
0 references
0.8273000717163086
0 references
