A Note on Diameter Certification in Trees
arXiv:2607.09929
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 -local certification scheme that certifies whether the diameter of a given tree is at most using certificates of at most bits.
arXiv comment5 pages, no figures