Work

A tight meta-theorem for LOCAL certification of MSO2 properties within bounded treewidth graphs

Year: 2025

Type: conference-paper

Abstract: Distributed networks are prone to errors so verifying their output is critical. We develop local certification protocols for graph properties in which nodes are given certificates that allow them to check whether the network as a whole satisfies some fixed property while only communicating with their local network. Instead of considering a specific problem and developing a local certification protocol tailor-made for the problem, we aim for generic protocols that can certify any property expressible in a certain logical framework.

Source: ACM Symposium on Principles of Distributed Computing (PODC)

DOI: 10.1145/3732772.3733562

Authors: Linda Cook, Eun Jung Kim, Tomáš Masařík

Institutions: University of Amsterdam, Centre National de la Recherche Scientifique, Korea Advanced Institute of Science and Technology, Institute for Basic Science, University of Warsaw

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Funders: European Commission, National Research Foundation, Nederlandse Organisatie voor Wetenschappelijk Onderzoek, Institute for Basic Science

Awards: NETWORKS Doctoral Program, G1938303756, G565383568