Constructing edge-disjoint spanning trees in twisted cubes (Q2638205): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ins.2010.05.041 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2000868378 / rank | |||
Normal rank | |||
Revision as of 01:16, 20 March 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
