{"id":"https://openalex.org/W2134342108","doi":"https://doi.org/10.1017/s0963548313000205","title":"Non-Deterministic Graph Property Testing","display_name":"Non-Deterministic Graph Property Testing","publication_year":2013,"publication_date":"2013-07-03","ids":{"openalex":"https://openalex.org/W2134342108","doi":"https://doi.org/10.1017/s0963548313000205","mag":"2134342108"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548313000205","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548313000205","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/6D8B9DDD3A27E1D4DA5C03D8779C256D/S0963548313000205a.pdf/div-class-title-non-deterministic-graph-property-testing-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/6D8B9DDD3A27E1D4DA5C03D8779C256D/S0963548313000205a.pdf/div-class-title-non-deterministic-graph-property-testing-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"L\u00c1SZL\u00d3 LOV\u00c1SZ","orcid":null},"institutions":[{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"L\u00c1SZL\u00d3 LOV\u00c1SZ","raw_affiliation_strings":["Institute of Mathematics, E\u00f6tv\u00f6s Lor\u00e1nd University, Budapest, Hungary (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Mathematics, E\u00f6tv\u00f6s Lor\u00e1nd University, Budapest, Hungary (e-mail:","institution_ids":["https://openalex.org/I106118109"]}]},{"author_position":"last","author":{"id":null,"display_name":"KATALIN VESZTERGOMBI","orcid":null},"institutions":[{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"KATALIN VESZTERGOMBI","raw_affiliation_strings":["Institute of Mathematics, E\u00f6tv\u00f6s Lor\u00e1nd University, Budapest, Hungary (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Mathematics, E\u00f6tv\u00f6s Lor\u00e1nd University, Budapest, Hungary (e-mail:","institution_ids":["https://openalex.org/I106118109"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I106118109"],"apc_list":null,"apc_paid":null,"fwci":0.7123,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.74937169,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"22","issue":"5","first_page":"749","last_page":"762"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.38339999318122864,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.38339999318122864,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.2856999933719635,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.03779999911785126,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.6236000061035156},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.5609999895095825},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.5113000273704529},{"id":"https://openalex.org/keywords/binary-relation","display_name":"Binary relation","score":0.5105000138282776},{"id":"https://openalex.org/keywords/graph-property","display_name":"Graph property","score":0.40939998626708984},{"id":"https://openalex.org/keywords/certificate","display_name":"Certificate","score":0.4074000120162964}],"concepts":[{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.6236000061035156},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6026999950408936},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5722000002861023},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.5609999895095825},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.5113000273704529},{"id":"https://openalex.org/C65180967","wikidata":"https://www.wikidata.org/wiki/Q130901","display_name":"Binary relation","level":2,"score":0.5105000138282776},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.40939998626708984},{"id":"https://openalex.org/C96865113","wikidata":"https://www.wikidata.org/wiki/Q2946816","display_name":"Certificate","level":2,"score":0.4074000120162964},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3982999920845032},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37610000371932983},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3727000057697296},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36880001425743103},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3352000117301941},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.33320000767707825},{"id":"https://openalex.org/C123842658","wikidata":"https://www.wikidata.org/wiki/Q2918980","display_name":"Property testing","level":2,"score":0.33180001378059387},{"id":"https://openalex.org/C68103157","wikidata":"https://www.wikidata.org/wiki/Q569347","display_name":"Graph product","level":5,"score":0.322299987077713},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28360000252723694},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.25290000438690186}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s0963548313000205","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548313000205","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/6D8B9DDD3A27E1D4DA5C03D8779C256D/S0963548313000205a.pdf/div-class-title-non-deterministic-graph-property-testing-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1202.5337","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1202.5337","pdf_url":"https://arxiv.org/pdf/1202.5337","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.1017/s0963548313000205","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548313000205","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/6D8B9DDD3A27E1D4DA5C03D8779C256D/S0963548313000205a.pdf/div-class-title-non-deterministic-graph-property-testing-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6651341434","display_name":"CDI Type II:  Pseudorandomness","funder_award_id":"0835373","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2134342108.pdf","grobid_xml":"https://content.openalex.org/works/W2134342108.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W273178449","https://openalex.org/W1684722273","https://openalex.org/W1970630090","https://openalex.org/W1985538939","https://openalex.org/W2018925011","https://openalex.org/W2027048490","https://openalex.org/W2043632298","https://openalex.org/W2068571612","https://openalex.org/W2069200876","https://openalex.org/W2072858942","https://openalex.org/W2076664242","https://openalex.org/W2082734581","https://openalex.org/W2111754130","https://openalex.org/W2137365113","https://openalex.org/W3008660429","https://openalex.org/W4255563008"],"related_works":[],"abstract_inverted_index":{"A":[0],"property":[1],"of":[2,38,52,58],"finite":[3],"graphs":[4],"is":[5,19],"called":[6],"non-deterministically":[7,64],"testable":[8,65],"if":[9],"it":[10],"has":[11],"a":[12],"\u2018certificate\u2019":[13],"such":[14],"that":[15,36,63],"once":[16],"the":[17,47,50,56],"certificate":[18],"specified,":[20],"its":[21],"correctness":[22],"can":[23],"be":[24],"verified":[25],"by":[26],"random":[27],"local":[28],"testing.":[29],"In":[30],"this":[31],"paper":[32],"we":[33,61],"study":[34],"certificates":[35],"consist":[37],"one":[39],"or":[40],"more":[41],"unary":[42],"and/or":[43],"binary":[44],"relations":[45],"on":[46],"nodes,":[48],"in":[49],"case":[51],"dense":[53],"graphs.":[54],"Using":[55],"theory":[57],"graph":[59],"limits,":[60],"prove":[62],"properties":[66],"are":[67],"also":[68],"deterministically":[69],"testable.":[70]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2016-06-24T00:00:00"}