AI 中文总结
研究树中直径认证问题，提出一种1 - 局部认证方案，该方案能以至多3⌈log₂(d + 1)⌉比特的证书认证给定树直径是否至多为d，提供了更高效的解决方案。
AI 中文摘要
在局部认证模型中，认证一般图的直径需要大证书，但树有更高效的解决方案。本文给出一种1 - 局部认证方案，用至多3⌈log₂(d + 1)⌉比特的证书来认证给定树的直径是否至多为d。
英文摘要
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 $3\lceil\log_2(d+1)\rceil$ bits.
Comments5 pages, no figures
