A Note on Diameter Certification in Trees
Abstract
In the local certification model, certifying the diameter of general graphs requires large certificates, but trees admit more efficient solutions. In this note, we provide a 1-local certification scheme that certifies whether the diameter of a given tree is at most d using certificates of at most 32(d+1) bits.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.