Introduction to local certification

A distributed graph algorithm is basically an algorithm where every node of a graph can look at its neighborhood at some distance in the graph and chose its output. As distributed environment are subject to faults, an important issue is to be able to check that the output is correct, or in general t...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Discrete Mathematics and Theoretical Computer Science Ročník 23, no. 3; číslo Distributed Computing and...; s. 1 - 23
Hlavný autor: Feuilloley, Laurent
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Nancy DMTCS 01.09.2021
Discrete Mathematics & Theoretical Computer Science
Predmet:
Algorithms
Certification
Computational Complexity
Computer Science
computer science - data structures and algorithms
computer science - distributed, parallel, and cluster computing
Configurations
Data Structures and Algorithms
Distributed, Parallel, and Cluster Computing
Labeling
Labels
Mathematical research
France
proof-labeling scheme
locally checkable proofs
distributed decision
Local certification
ISSN:1365-8050, 1462-7264, 1365-8050
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:A distributed graph algorithm is basically an algorithm where every node of a graph can look at its neighborhood at some distance in the graph and chose its output. As distributed environment are subject to faults, an important issue is to be able to check that the output is correct, or in general that the network is in proper configuration with respect to some predicate. One would like this checking to be very local, to avoid using too much resources. Unfortunately most predicates cannot be checked this way, and that is where certification comes into play. Local certification (also known as proof-labeling schemes, locally checkable proofs or distributed verification) consists in assigning labels to the nodes, that certify that the configuration is correct. There are several point of view on this topic: it can be seen as a part of self-stabilizing algorithms, as labeling problem, or as a non-deterministic distributed decision. This paper is an introduction to the domain of local certification, giving an overview of the history, the techniques and the current research directions.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:1365-8050
1462-7264
1365-8050
DOI:10.46298/dmtcs.6280