Constructing edge-disjoint spanning trees in locally twisted cubes (Q1006074)
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 edge-disjoint spanning trees in locally twisted cubes |
scientific article; zbMATH DE number 5529518
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constructing edge-disjoint spanning trees in locally twisted cubes |
scientific article; zbMATH DE number 5529518 |
Statements
Constructing edge-disjoint spanning trees in locally twisted cubes (English)
0 references
17 March 2009
0 references
data broadcasting
0 references
design and analysis of algorithms
0 references
edge-disjoint spanning trees
0 references
graph-theoretic interconnection networks
0 references
locally twisted cubes
0 references
0 references
0.97930837
0 references
0.9488275
0 references
0.94858056
0 references
0.9213833
0 references
0.9182375
0 references
0.9069548
0 references
0.90074766
0 references
0.8988087
0 references
0.8879641
0 references
0.8846546
0 references
