Proof labeling schemes
From MaRDI portal
Publication:5177219
DOI10.1145/1073814.1073817zbMath1314.68066OpenAlexW2147327383MaRDI QIDQ5177219
Shay Kutten, Amos Korman, David Peleg
Publication date: 10 March 2015
Published in: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1073814.1073817
Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Distributed algorithms (68W15)
Related Items
Proof labeling schemes ⋮ Local MST computation with short advice ⋮ Distributed verification of minimum spanning trees ⋮ Local Maps: New Insights into Mobile Agent Algorithms ⋮ Distributed Relationship Schemes for Trees ⋮ Online computation with advice ⋮ Trade-offs between the size of advice and broadcasting time in trees ⋮ Communication algorithms with advice ⋮ Unnamed Item ⋮ Labeling schemes for tree representation ⋮ Introduction to local certification
