Constructing edge-disjoint spanning trees in twisted cubes (Q2638205): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:23, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constructing edge-disjoint spanning trees in twisted cubes |
scientific article |
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
