DeepAI AI Chat
Log In Sign Up

Note on distributed certification of minimum spanning trees

by   Laurent Feuilloley, et al.
Universidad de Chile

A distributed proof (also known as local certification, or proof-labeling scheme) is a mechanism to certify that the solution to a graph problem is correct. It takes the form of an assignment of labels to the nodes, that can be checked locally. There exists such a proof for the minimum spanning tree problem, using O(log n log W) bit labels (where n is the number of nodes in the graph, and W is the largest weight of an edge). This is due to Korman and Kutten who describe it in concise and formal manner in [Korman and Kutten 07]. In this note, we propose a more intuitive description of the result, as well as a gentle introduction to the problem.


page 1

page 2

page 3

page 4


Distributed Algorithms for Minimum Degree Spanning Trees

The minimum degree spanning tree (MDST) problem requires the constructio...

Reactive Proof Labeling Schemes for Distributed Decision

We generalize the definition of Proof Labeling Schemes to reactive syste...

Introduction to local certification

Local certification is an concept that has been defined and studied rece...

Locally Restricted Proof Labeling Schemes (Full Version)

Introduced by Korman, Kutten, and Peleg (PODC 2005), a proof labeling sc...

Twenty-Two New Approximate Proof Labeling Schemes (Full Version)

Introduced by Korman, Kutten, and Peleg (Distributed Computing 2005), a ...

Random Spanning Trees and the Prediction of Weighted Graphs

We investigate the problem of sequentially predicting the binary labels ...

Redundancy in Distributed Proofs

Distributed proofs are mechanisms enabling the nodes of a network to col...