Tight bounds for distributed minimum-weight spanning tree verification (Q372968)
From MaRDI portal
(Redirected from Item:Q3113673)
| 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: Tight bounds for distributed minimum-weight spanning tree verification |
scientific article; zbMATH DE number 5999536
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight bounds for distributed minimum-weight spanning tree verification |
scientific article; zbMATH DE number 5999536 |
Statements
Tight bounds for distributed minimum-weight spanning tree verification (English)
0 references
21 October 2013
0 references
23 January 2012
0 references
distributed algorithms
0 references
distributed verification
0 references
labeling schemes
0 references
minimum-weight spanning tree
0 references
0 references
0.972584068775177
0 references
0.8857883214950562
0 references