A two-stages tree-searching algorithm for finding three completely independent spanning trees (Q2317871)
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 two-stages tree-searching algorithm for finding three completely independent spanning trees |
scientific article; zbMATH DE number 7093361
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A two-stages tree-searching algorithm for finding three completely independent spanning trees |
scientific article; zbMATH DE number 7093361 |
Statements
A two-stages tree-searching algorithm for finding three completely independent spanning trees (English)
0 references
13 August 2019
0 references
completely independent spanning trees
0 references
interconnection networks
0 references
locally twisted cubes
0 references
crossed cubes
0 references
diameter
0 references
tree searching algorithms
0 references
0 references
0 references
0 references
0.8569118976593018
0 references
0.8518850207328796
0 references
0.8356022238731384
0 references
0.8045159578323364
0 references
0.8002996444702148
0 references
