An efficient parallel algorithm for multiple edge updates of minimum spanning trees on sparse graphs (Q2769372)
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: An efficient parallel algorithm for multiple edge updates of minimum spanning trees on sparse graphs |
scientific article; zbMATH DE number 1701300
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient parallel algorithm for multiple edge updates of minimum spanning trees on sparse graphs |
scientific article; zbMATH DE number 1701300 |
Statements
5 February 2002
0 references
An efficient parallel algorithm for multiple edge updates of minimum spanning trees on sparse graphs (English)
0 references
0.9197075366973876
0 references
0.8908777236938477
0 references
0.8904968500137329
0 references
0.8898478746414185
0 references
