A fast parallel algorithm for constructing independent spanning trees on parity cubes (Q668143)
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 fast parallel algorithm for constructing independent spanning trees on parity cubes |
scientific article; zbMATH DE number 7037694
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast parallel algorithm for constructing independent spanning trees on parity cubes |
scientific article; zbMATH DE number 7037694 |
Statements
A fast parallel algorithm for constructing independent spanning trees on parity cubes (English)
0 references
18 March 2019
0 references
parallel algorithms
0 references
independent spanning trees
0 references
parity cubes
0 references
interconnection networks
0 references
0 references
0 references
0 references
0 references
