Optimal parallel verification of minimum spanning trees in logarithmic time (Q2365173)
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 968825
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal parallel verification of minimum spanning trees in logarithmic time |
scientific article; zbMATH DE number 968825 |
Statements
Optimal parallel verification of minimum spanning trees in logarithmic time (English)
0 references
22 January 1997
0 references
optimal parallel algorithms
0 references
verification
0 references
sensitivity analysis
0 references
minimum spanning trees
0 references
0 references
0 references
0 references
0.9011338949203492
0 references
0.8660014271736145
0 references
0.8480516076087952
0 references
0.844092607498169
0 references
