Constructing vertex-disjoint paths in \((n, k)\)-star graphs (Q2466076)
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: Constructing vertex-disjoint paths in (n, k)-star graphs |
scientific article; zbMATH DE number 5225298
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constructing vertex-disjoint paths in \((n, k)\)-star graphs |
scientific article; zbMATH DE number 5225298 |
Statements
Constructing vertex-disjoint paths in \((n, k)\)-star graphs (English)
0 references
11 January 2008
0 references
(\(n
0 references
k\))-star graphs
0 references
star graphs
0 references
graph theory
0 references
interconnection networks
0 references
wide diameter
0 references
vertex-disjoint paths
0 references
container
0 references
0 references
0 references
0 references
0.8623039126396179
0 references
0.8109397292137146
0 references
0.7930164337158203
0 references
