Compact Distributed Certification of Planar Graphs

DOI10.1145/3382734.3404505MaRDI QIDQ5855251zbMATH OpenOpenAlexWikidataFDO

Authors Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Eric Rémila, Ioan Todinca

Publication date 15 March 2021

Published in Proceedings of the 39th Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2005.05863

zbMATH Keywords

fault-tolerancecommunication networksdistributed graph algorithms

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Cited in

(6)

• Introduction to local certification
• Bounds on the genus for 2-cell embeddings of prefix-reversal graphs
• Compact distributed certification of planar graphs
• A study on quantum graphs
• Local certification of graphs on surfaces
• Distributed interactive proofs for the recognition of some geometric intersection graph classes

This page was built for publication: Compact Distributed Certification of Planar Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5855251)