Decreasing verification radius in local certification
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F24%3A00378850" target="_blank" >RIV/68407700:21240/24:00378850 - isvavai.cz</a>
Result on the web
<a href="https://link.springer.com/chapter/10.1007/978-3-031-74580-5_14" target="_blank" >https://link.springer.com/chapter/10.1007/978-3-031-74580-5_14</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-031-74580-5_14" target="_blank" >10.1007/978-3-031-74580-5_14</a>
Alternative languages
Result language
angličtina
Original language name
Decreasing verification radius in local certification
Original language description
This paper deals with local certification, specifically locally checkable proofs: given a graph property, the task is to certify whether a graph satisfies the property. The verification of this certification needs to be done locally without the knowledge of the whole graph. More precisely, a distributed algorithm, called a verifier, is executed on each vertex. The verifier observes the local neighborhood up to a constant distance and either accepts or rejects. We examine the trade-off between the visibility radius and the size of certificates. We describe a procedure that decreases the radius by encoding the neighbourhood of each vertex into its certificate. We also provide a corresponding lower bound on the required certificate size increase, showing that such an approach is close to optimal.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2024
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Algorithmics of Wireless Networks
ISBN
978-3-031-74579-9
ISSN
0302-9743
e-ISSN
—
Number of pages
14
Pages from-to
188-201
Publisher name
Springer, Cham
Place of publication
—
Event location
Egham
Event date
Sep 5, 2024
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—