arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1202.5337math.COcs.DM
收藏

不确定图属性测试

Nondeterministic graph property testing

László Lovász, Katalin Vesztergombi

摘要:

有限图的一个性质被称为非确定性可测试的,如果它有一个“证书”,一旦证书被指定,它的正确性可以通过随机局部测试来验证。在本文中,我们研究的证书,包括一个或多个一元和/或二元关系的节点上,在稠密图的情况下。利用图的极限理论,我们证明了非确定性可测试的性质也是确定性可测试的。

英文摘要:

A property of finite graphs is called nondeterministically testable if it has a "certificate" such that once the certificate is specified, its correctness can be verified by random local testing. In this paper we study certificates that consist of one or more unary and/or binary relations on the nodes, in the case of dense graphs. Using the theory of graph limits, we prove that nondeterministically testable properties are also deterministically testable.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑