Constructing edge-disjoint spanning trees in twisted cubes (Q2638205)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5785938
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constructing edge-disjoint spanning trees in twisted cubes |
scientific article; zbMATH DE number 5785938 |
Statements
Constructing edge-disjoint spanning trees in twisted cubes (English)
0 references
15 September 2010
0 references
algorithms
0 references
edge-disjoint spanning trees
0 references
independent spanning trees
0 references
data broadcasting
0 references
fault-tolerance
0 references
twisted cubes
0 references
interconnection networks
0 references
0 references
0 references
0 references
0.9363936185836792
0 references
0.8917493224143982
0 references
0.8822561502456665
0 references
0.8714595437049866
0 references
0.8380265235900879
0 references
