Three theorems regarding testing graph properties

Author:

Goldreich Oded,Trevisan Luca

Publisher

Wiley

Subject

Applied Mathematics,Computer Graphics and Computer-Aided Design,General Mathematics,Software

Reference12 articles.

1. On properties closed under taking induced subgraphs, private communication, 2001.

2. Efficient Testing of Large Graphs

3. Simple Constructions of Almost k-wise Independent Random Variables

4. Testing k-colorability

5. and The probabilistic method, Wiley, New York, 1992.

Cited by 100 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification;SIAM Journal on Computing;2023-12-06

2. Testing Graph Properties with the Container Method;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

3. Hypergraph regularity and random sampling;Random Structures & Algorithms;2023-03

4. Non-adaptive vs Adaptive Queries in the Dense Graph Testing Model;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02

5. Testing graphs against an unknown distribution;Israel Journal of Mathematics;2021-10

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3