The Subgraph Testing Model

IF 0.8 Q3 COMPUTER SCIENCE, THEORY & METHODS ACM Transactions on Computation Theory Pub Date : 2020-11-08 DOI:10.1145/3428675
GoldreichOded, RonDana
{"title":"The Subgraph Testing Model","authors":"GoldreichOded, RonDana","doi":"10.1145/3428675","DOIUrl":null,"url":null,"abstract":"Following Newman (2010), we initiate a study of testing properties of graphs that are presented as subgraphs of a fixed (or an explicitly given) graph. The tester is given free access to a base gra...","PeriodicalId":44045,"journal":{"name":"ACM Transactions on Computation Theory","volume":"92 1","pages":"1-32"},"PeriodicalIF":0.8000,"publicationDate":"2020-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Computation Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3428675","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 1

Abstract

Following Newman (2010), we initiate a study of testing properties of graphs that are presented as subgraphs of a fixed (or an explicitly given) graph. The tester is given free access to a base gra...
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
子图测试模型
继Newman(2010)之后,我们开始研究作为固定(或显式给定)图的子图呈现的图的测试属性。测试者可以自由使用一个基本的gra。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
ACM Transactions on Computation Theory
ACM Transactions on Computation Theory COMPUTER SCIENCE, THEORY & METHODS-
CiteScore
2.30
自引率
0.00%
发文量
10
期刊最新文献
Tight Sum-of-Squares lower bounds for binary polynomial optimization problems Optimal Polynomial-time Compression for Boolean Max CSP On p -Group Isomorphism: search-to-decision, counting-to-decision, and nilpotency class reductions via tensors Quantum communication complexity of linear regression Sparsification Lower Bounds for List H -Coloring
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1