Two minimum spanning forest algorithms on fixed-size hypercube computers (Q916371): 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/0167-8191(90)90041-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2062851100 / rank | |||
Normal rank | |||
Latest revision as of 19:50, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two minimum spanning forest algorithms on fixed-size hypercube computers |
scientific article |
Statements
Two minimum spanning forest algorithms on fixed-size hypercube computers (English)
0 references
1990
0 references
graph problems
0 references
parallel algorithms
0 references
minimum spanning forest
0 references
hypercube computers
0 references
