识别余图和距离遗传图的紧致分布交互式证明
Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs
摘要:
我们提出了紧凑的分布式交互式证明的两个重要的图形类的识别,以及在集中式算法,即补充可约图和距离遗传图的背景下研究。补可约图(也称余图)是指不包含四结点路$P_4$作为导出子图的图。距离遗传图是上图的一个超类,定义为在每个导出连通子图上,任意一对顶点之间的距离(最短路)相等的图。首先,我们证明了存在一个分布式交互式的证明,用于识别具有两轮交互的共图。更准确地说,我们给出了一个$\mathsf{dAM}$协议的证明大小为$\mathcal{O}(\log n)$位,使用共享的随机性,并识别具有高概率的共图。此外,我们的协议可以适用于验证任何图灵可判定谓词限制到cograph在$\mathsf{dAM}$证书的大小$\mathcal{O}(\log n)$。其次,我们给出了一个三轮,$\mathsf{dMAM}$交互式协议的距离遗传图的识别,仍然与$\mathcal{O}(\log n)$位的证明大小,并使用共享的随机性。最后,我们表明,任何一轮(表示$\mathsf{dM}$)或两轮,$\mathsf{dMA}$协议的共图或距离遗传图的识别需要证书的大小$Ω(\log n)$位。此外,我们表明,任何恒定轮$\mathsf{dAM}$协议使用共享的随机性需要证书的大小$Ω(\log \log n)$。
英文摘要:
We present compact distributed interactive proofs for the recognition of two important graph classes, well-studied in the context of centralized algorithms, namely complement reducible graphs and distance-hereditary graphs. Complement reducible graphs (also called cographs) are defined as the graphs not containing a four-node path $P_4$ as an induced subgraph. Distance-hereditary graphs are a super-class of cographs, defined as the graphs where the distance (shortest paths) between any pair of vertices is the same on every induced connected subgraph. First, we show that there exists a distributed interactive proof for the recognition of cographs with two rounds of interaction. More precisely, we give a $\mathsf{dAM}$ protocol with a proof size of $\mathcal{O}(\log n)$ bits that uses shared randomness and recognizes cographs with high probability. Moreover, our protocol can be adapted to verify any Turing-decidable predicate restricted to cographs in $\mathsf{dAM}$ with certificates of size $\mathcal{O}(\log n)$. Second, we give a three-round, $\mathsf{dMAM}$ interactive protocol for the recognition of distance-hereditary graphs, still with a proof size of $\mathcal{O}(\log n)$ bits and also using shared randomness. Finally, we show that any one-round (denoted $\mathsf{dM}$) or two-round, $\mathsf{dMA}$ protocol for the recognition of cographs or distance-hereditary graphs requires certificates of size $Ω(\log n)$ bits. Moreover, we show that any constant-round $\mathsf{dAM}$ protocol using shared randomness requires certificates of size $Ω(\log \log n)$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。