A parallel algorithm for constructing independent spanning trees in twisted cubes (Q505426)
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: A parallel algorithm for constructing independent spanning trees in twisted cubes |
scientific article; zbMATH DE number 6676763
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallel algorithm for constructing independent spanning trees in twisted cubes |
scientific article; zbMATH DE number 6676763 |
Statements
A parallel algorithm for constructing independent spanning trees in twisted cubes (English)
0 references
23 January 2017
0 references
parallel algorithms
0 references
independent spanning trees
0 references
interconnection networks
0 references
twisted cubes
0 references
0 references
0 references
0 references
0.9707928
0 references
0.9554187
0 references
0.9459837
0 references
0.9171364
0 references
0.91529125
0 references
0.9136958
0 references
0.91024446
0 references
0.8995369
0 references
0.8956564
0 references
0 references
