A fast parallel algorithm for constructing independent spanning trees on parity cubes (Q668143): 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.amc.2015.06.081 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W931020699 / rank | |||
Normal rank |
Revision as of 01:50, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A fast parallel algorithm for constructing independent spanning trees on parity cubes |
scientific article |
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