Computing minimum spanning forests on 1- and 2-dimensional processor arrays (extended abstract) (Q5096153)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7571926
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing minimum spanning forests on 1- and 2-dimensional processor arrays (extended abstract) |
scientific article; zbMATH DE number 7571926 |
Statements
Computing minimum spanning forests on 1- and 2-dimensional processor arrays (English)
0 references
16 August 2022
0 references
adjacency matrix
0 references
edge incidence
0 references
internal computation
0 references
adjacency list
0 references
spanning forest
0 references
0.8565183281898499
0 references
0.7898462414741516
0 references
0.7878563404083252
0 references
0.7864617109298706
0 references
