Associative parallel algorithm for dynamic update of a minimum spanning tree after addition of a new node to a graph (Q2501326)
From MaRDI portal
!
WARNING
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 5051588
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Associative parallel algorithm for dynamic update of a minimum spanning tree after addition of a new node to a graph |
scientific article; zbMATH DE number 5051588 |
Statements
Associative parallel algorithm for dynamic update of a minimum spanning tree after addition of a new node to a graph (English)
0 references
6 September 2006
0 references
undirected weighted graph
0 references
0 references
0 references
0.92039585
0 references
0.90939593
0 references
0.9082353
0 references
0.90666586
0 references
0.9028248
0 references
