Tight bounds on the message complexity of distributed tree verification (Q6954066)
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 8068826
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight bounds on the message complexity of distributed tree verification |
scientific article; zbMATH DE number 8068826 |
Statements
Tight bounds on the message complexity of distributed tree verification (English)
0 references
24 July 2025
0 references
distributed graph verification
0 references
message complexity
0 references
lower bound
0 references
distributed minimum spanning tree
0 references
