Constructing independent spanning trees on bubble-sort networks (Q1790945)
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: Constructing independent spanning trees on bubble-sort networks |
scientific article; zbMATH DE number 6946772
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constructing independent spanning trees on bubble-sort networks |
scientific article; zbMATH DE number 6946772 |
Statements
Constructing independent spanning trees on bubble-sort networks (English)
0 references
4 October 2018
0 references
independent spanning trees
0 references
bubble-sort networks
0 references
interconnection networks
0 references
Cayley graphs
0 references
0.9477946162223816
0 references
0.8537009954452515
0 references
0.8122641444206238
0 references
0.7940974831581116
0 references
0.7906621694564819
0 references
