Fast distributed algorithms for testing graph properties

We initiate a thorough study of distributed property testing —producing algorithms for the approximation problems of property testing in the CONGEST model. In particular, for the so-called dense graph testing model we emulate sequential tests for nearly all graph properties having 1-sided tests, whi...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Distributed computing Ročník 32; číslo 1; s. 41 - 57
Hlavní autoři:	Censor-Hillel, Keren, Fischer, Eldar, Schwartzman, Gregory, Vasudev, Yadu
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.02.2019 Springer Nature B.V
Témata:	Algorithms Computer Communication Networks Computer Hardware Computer Science Computer Systems Organization and Communication Networks Lower bounds Machinery Model testing Properties (attributes) Run time (computers) Software Engineering/Programming and Operating Systems Task complexity Theory of Computation Testing Bipartiteness Proof Labeling Schemes Dense Graph Model Induced Subgraph Property Testing
ISSN:	0178-2770, 1432-0452
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	We initiate a thorough study of distributed property testing —producing algorithms for the approximation problems of property testing in the CONGEST model. In particular, for the so-called dense graph testing model we emulate sequential tests for nearly all graph properties having 1-sided tests, while in the general model we obtain faster tests for triangle-freeness and cycle-freeness, and in the sparse model we obtain a faster test for bipartiteness. In addition, we show a logarithmic lower bound for testing bipartiteness and cycle-freeness, which holds even in the stronger LOCAL model. In most cases, aided by parallelism, the distributed algorithms have a much shorter running time than their counterparts from the sequential querying model of traditional property testing. More importantly, the distributed algorithms we develop for testing graph properties are in many cases much faster than what is known for exactly deciding whether the property holds. The simplest property testing algorithms allow a relatively smooth transition to the distributed model. For the more complex tasks we develop new machinery that may be of independent interest.
AbstractList	We initiate a thorough study of distributed property testing—producing algorithms for the approximation problems of property testing in the CONGEST model. In particular, for the so-called dense graph testing model we emulate sequential tests for nearly all graph properties having 1-sided tests, while in the general model we obtain faster tests for triangle-freeness and cycle-freeness, and in the sparse model we obtain a faster test for bipartiteness. In addition, we show a logarithmic lower bound for testing bipartiteness and cycle-freeness, which holds even in the stronger LOCAL model. In most cases, aided by parallelism, the distributed algorithms have a much shorter running time than their counterparts from the sequential querying model of traditional property testing. More importantly, the distributed algorithms we develop for testing graph properties are in many cases much faster than what is known for exactly deciding whether the property holds. The simplest property testing algorithms allow a relatively smooth transition to the distributed model. For the more complex tasks we develop new machinery that may be of independent interest. We initiate a thorough study of distributed property testing —producing algorithms for the approximation problems of property testing in the CONGEST model. In particular, for the so-called dense graph testing model we emulate sequential tests for nearly all graph properties having 1-sided tests, while in the general model we obtain faster tests for triangle-freeness and cycle-freeness, and in the sparse model we obtain a faster test for bipartiteness. In addition, we show a logarithmic lower bound for testing bipartiteness and cycle-freeness, which holds even in the stronger LOCAL model. In most cases, aided by parallelism, the distributed algorithms have a much shorter running time than their counterparts from the sequential querying model of traditional property testing. More importantly, the distributed algorithms we develop for testing graph properties are in many cases much faster than what is known for exactly deciding whether the property holds. The simplest property testing algorithms allow a relatively smooth transition to the distributed model. For the more complex tasks we develop new machinery that may be of independent interest.
Author	Fischer, Eldar Vasudev, Yadu Censor-Hillel, Keren Schwartzman, Gregory
Author_xml	– sequence: 1 givenname: Keren surname: Censor-Hillel fullname: Censor-Hillel, Keren email: ckeren@cs.technion.ac.il organization: Department of Computer Science, Technion – Israel Institute of Technology – sequence: 2 givenname: Eldar surname: Fischer fullname: Fischer, Eldar organization: Department of Computer Science, Technion – Israel Institute of Technology – sequence: 3 givenname: Gregory surname: Schwartzman fullname: Schwartzman, Gregory organization: Department of Computer Science, Technion – Israel Institute of Technology – sequence: 4 givenname: Yadu surname: Vasudev fullname: Vasudev, Yadu organization: Department of Computer Science, Technion – Israel Institute of Technology
BookMark	eNp9kDFPwzAQhS1UJErhB7BFYjbc2U7sjKiigFSJBWbLSS6pqzYptjvw70kVBoQE0y3vu_f0XbJZP_TE2A3CHQLo-wigVMEBDQcpFDdnbI5KCg4qFzM2B9SGC63hgl3GuAUAiSjmzKxcTFnjYwq-OiZqMrfrhuDTZh-zdghZoph832VdcIdNdgjDgULyFK_Yeet2ka6_74K9rx7fls98_fr0snxY81pikXgJjQBRo8acWpCyKRxQTapR1DqhSYAsjaioNFhWLQqdU0FVTsKo2imp5ILdTn_H6o_jOMZuh2Pox0qLZSlR69KYMaWnVB2GGAO1tvbJJT_0KTi_swj2pMlOmuyoyZ402ROJv8hD8HsXPv9lxMTEMdt3FH5s-hP6AjCRe2o
CitedBy_id	crossref_primary_10_1007_s00446_023_00442_4 crossref_primary_10_1007_s11128_020_02652_2 crossref_primary_10_1109_TNET_2023_3273501 crossref_primary_10_1016_j_jpdc_2022_04_015 crossref_primary_10_1007_s00446_024_00470_8 crossref_primary_10_1016_j_jpdc_2024_104954 crossref_primary_10_1145_3694966 crossref_primary_10_1007_s11227_024_06269_5
Cites_doi	10.1007/s004930050060 10.1016/j.ic.2014.12.018 10.1137/S0097539703436424 10.1002/rsa.10078 10.1002/rsa.10023 10.1137/11085178X 10.1016/j.tcs.2007.04.040 10.1017/S0963548311000125 10.1002/rsa.10013 10.1145/285055.285060 10.1561/0400000029 10.1137/06064888X 10.1142/9789812562494_0014 10.1007/s00453-001-0078-7 10.1007/s00446-011-0132-x 10.1137/S0895480199358655 10.1016/0022-0000(93)90044-W 10.1137/07067917X 10.1007/s00446-010-0095-3 10.1137/S0097539793255151 10.1017/CBO9780511813603 10.4007/annals.2006.164.51 10.1137/1.9780898719772 10.1561/2200000004 10.1145/2332432.2332504 10.1145/2767386.2767414 10.1145/2833312.2833315 10.1145/3087801.3087827 10.1145/2332432.2332443 10.1145/2611462.2611493 10.1007/978-3-319-12340-0_2 10.1145/2484239.2484262 10.1007/978-3-642-16367-8_23 10.1145/3087801.3087811 10.1007/978-3-319-25258-2_26 10.1145/2767386.2767421 10.1007/978-3-662-53426-7_15
ContentType	Journal Article
Copyright	Springer-Verlag GmbH Germany, part of Springer Nature 2018 Distributed Computing is a copyright of Springer, (2018). All Rights Reserved.
Copyright_xml	– notice: Springer-Verlag GmbH Germany, part of Springer Nature 2018 – notice: Distributed Computing is a copyright of Springer, (2018). All Rights Reserved.
DBID	AAYXX CITATION 3V. 7RQ 7SC 7XB 8AL 8AO 8FD 8FE 8FG 8FK ABUWG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ HCIFZ JQ2 K7- L7M L~C L~D M0N P5Z P62 PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI PRINS Q9U U9A
DOI	10.1007/s00446-018-0324-8
DatabaseName	CrossRef ProQuest Central (Corporate) Career & Technical Education Database Computer and Information Systems Abstracts ProQuest Central (purchase pre-March 2016) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ProQuest Central (Alumni) ProQuest Central UK/Ireland Health Research Premium Collection ProQuest Central Essentials ProQuest Central - New (Subscription) Technology collection ProQuest One Community College ProQuest Central Korea ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Computing Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China ProQuest Central Basic
DatabaseTitle	CrossRef Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Pharma Collection ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Central Korea ProQuest Central (New) Advanced Technologies Database with Aerospace Career and Technical Education (Alumni Edition) Advanced Technologies & Aerospace Collection ProQuest Computing ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest Career and Technical Education ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ProQuest Central (Alumni)
DatabaseTitleList	Computer Science Database
Database_xml	– sequence: 1 dbid: 7RQ name: Career & Technical Education Database url: https://search.proquest.com/career sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science
EISSN	1432-0452
EndPage	57
ExternalDocumentID	10_1007_s00446_018_0324_8
GrantInformation_xml	– fundername: Israel Science Foundation grantid: 1696/14 funderid: http://dx.doi.org/10.13039/501100003977
GroupedDBID	-4Z -59 -5G -BR -EM -~C -~X .4S .86 .DC .VR 06D 0R~ 0VY 1N0 203 29G 2J2 2JN 2JY 2KG 2LR 2~H 30V 4.4 406 408 409 40D 40E 5GY 5VS 67Z 6NX 78A 7RQ 8AO 8FE 8FG 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYZH ABAKF ABBBX ABBXA ABDBF ABDPE ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABSXP ABTEG ABTHY ABTKH ABTMW ABUWG ABWNU ABXPI ACAOD ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACUHS ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADMLS ADRFC ADTPH ADURQ ADYFF ADZKW AEFQL AEGAL AEGNC AEJHL AEJRE AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARCSS ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN AZQEC B-. B0M BA0 BDATZ BENPR BGLVJ BGNMA BPHCQ BSONS CCPQU CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 DWQXO EAD EAP EBD EBLON EBS EDO EIOEI EJD EMK EPL ESBYG ESX FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ6 GQ7 GQ8 GXS HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF I-F I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K6V K7- KDC KOV LAS LLZTM M0N M4Y MA- N9A NPVJJ NQJWS NU0 O93 O9G O9I O9J OAM P19 P2P P62 P9O PF0 PQQKQ PROAC PT4 PT5 Q2X QOK QOS R89 R9I RHV ROL RPX RSV S16 S27 S3B SAP SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TN5 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR YZZ Z45 Z7X Z83 Z88 Z8R Z8W Z92 ZCA ZMTXR ~8M ~EX -Y2 1SB 28- 2P1 2VQ 5QI AAOBN AAPKM AARHV AAYTO AAYXX ABBRH ABDBE ABFSG ABQSL ABRTQ ABULA ACBXY ACSTC ADHKG AEBTG AEFIE AEKMD AETEA AEZWR AFDZB AFEXP AFFHD AFGCZ AFHIU AFOHR AGGDS AGJBK AGQPQ AHPBZ AHWEU AIXLP AJBLW ATHPR AYFIA BBWZM CAG CITATION COF H13 HZ~ H~9 KOW N2Q NDZJH O9- PHGZM PHGZT PQGLB R4E RNI RZK S1Z S26 S28 SCJ SCLPG T16 3V. 7SC 7XB 8AL 8FD 8FK JQ2 L7M L~C L~D PKEHL PQEST PQUKI PRINS Q9U U9A
ID	FETCH-LOGICAL-c316t-90d202c1715ef033d6a0ece4d4efa27e203982be9819bf1275e6eb5e284ca4343
IEDL.DBID	7RQ
ISICitedReferencesCount	25
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000456193800003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0178-2770
IngestDate	Tue Dec 02 15:59:14 EST 2025 Tue Nov 18 21:43:31 EST 2025 Sat Nov 29 06:13:26 EST 2025 Fri Feb 21 02:40:06 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	1
Keywords	Testing Bipartiteness Proof Labeling Schemes Dense Graph Model Induced Subgraph Property Testing
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c316t-90d202c1715ef033d6a0ece4d4efa27e203982be9819bf1275e6eb5e284ca4343
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
PQID	1993177988
PQPubID	31799
PageCount	17
ParticipantIDs	proquest_journals_1993177988 crossref_citationtrail_10_1007_s00446_018_0324_8 crossref_primary_10_1007_s00446_018_0324_8 springer_journals_10_1007_s00446_018_0324_8
PublicationCentury	2000
PublicationDate	2019-02-01
PublicationDateYYYYMMDD	2019-02-01
PublicationDate_xml	– month: 02 year: 2019 text: 2019-02-01 day: 01
PublicationDecade	2010
PublicationPlace	Berlin/Heidelberg
PublicationPlace_xml	– name: Berlin/Heidelberg – name: Heidelberg
PublicationTitle	Distributed computing
PublicationTitleAbbrev	Distrib. Comput
PublicationYear	2019
Publisher	Springer Berlin Heidelberg Springer Nature B.V
Publisher_xml	– name: Springer Berlin Heidelberg – name: Springer Nature B.V
References	Erdös (CR15) 1959; 11 Parnas, Ron (CR35) 2002; 20 Fischer (CR17) 2004; I Pettie, Hsin-Hao (CR38) 2015; 243 Ron (CR40) 2009; 5 CR19 Goldreich, Goldwasser, Ron (CR21) 1998; 45 Kaufman, Krivelevich, Ron (CR31) 2004; 33 Parnas, Ron (CR36) 2007; 381 CR18 CR16 CR14 CR13 CR12 Rubinfeld, Sudan (CR41) 1996; 25 CR33 CR10 Sarma, Nanongkai, Pandurangan, Tetali (CR43) 2013; 60 Sarma, Stephan, Kor, Korman, Nanongkai, Pandurangan, Peleg, Wattenhofer (CR42) 2012; 41 Alon, Krivelevich (CR3) 2002; 15 CR30 Chudnovsky, Robertson, Seymour, Thomas (CR11) 2006; 164 Alon, Avin, Koucký, Kozma, Lotker, Tuttle (CR1) 2011; 20 Mitzenmacher, Upfal (CR34) 2005 CR6 CR5 Brakerski, Patt-Shamir (CR9) 2011; 24 CR29 Korman, Kutten, Peleg (CR32) 2010; 22 CR28 Peleg (CR37) 2000 CR27 Goldreich, Ron (CR22) 1999; 19 CR26 Alon, Shapira (CR4) 2008; 37 Goldreich, Ron (CR23) 2002; 32 CR24 Bender, Ron (CR7) 2002; 20 Blum, Luby, Rubinfeld (CR8) 1993; 47 CR20 Goldreich, Trevisan (CR25) 2003; 23 Alon, Kaufman, Krivelevich, Ron (CR2) 2008; 22 Ron (CR39) 2008; 1 S Pettie (324_CR38) 2015; 243 E Fischer (324_CR17) 2004; I N Alon (324_CR3) 2002; 15 324_CR19 324_CR18 AD Sarma (324_CR42) 2012; 41 M Chudnovsky (324_CR11) 2006; 164 O Goldreich (324_CR25) 2003; 23 324_CR24 M Parnas (324_CR35) 2002; 20 N Alon (324_CR4) 2008; 37 324_CR26 T Kaufman (324_CR31) 2004; 33 324_CR28 A Korman (324_CR32) 2010; 22 324_CR27 R Rubinfeld (324_CR41) 1996; 25 MA Bender (324_CR7) 2002; 20 AD Sarma (324_CR43) 2013; 60 324_CR20 D Ron (324_CR40) 2009; 5 O Goldreich (324_CR22) 1999; 19 N Alon (324_CR1) 2011; 20 O Goldreich (324_CR23) 2002; 32 D Ron (324_CR39) 2008; 1 324_CR6 324_CR5 Z Brakerski (324_CR9) 2011; 24 324_CR29 O Goldreich (324_CR21) 1998; 45 D Peleg (324_CR37) 2000 324_CR33 M Mitzenmacher (324_CR34) 2005 324_CR10 324_CR13 324_CR12 324_CR14 M Parnas (324_CR36) 2007; 381 N Alon (324_CR2) 2008; 22 324_CR16 P Erdös (324_CR15) 1959; 11 M Blum (324_CR8) 1993; 47 324_CR30
References_xml	– volume: 19 start-page: 335 issue: 3 year: 1999 end-page: 373 ident: CR22 article-title: A sublinear bipartiteness tester for bounded degree graphs publication-title: Combinatorica doi: 10.1007/s004930050060 – volume: 243 start-page: 263 year: 2015 end-page: 280 ident: CR38 article-title: Distributed coloring algorithms for triangle-free graphs publication-title: Inf. Comput. doi: 10.1016/j.ic.2014.12.018 – ident: CR18 – volume: 33 start-page: 1441 issue: 6 year: 2004 end-page: 1483 ident: CR31 article-title: Tight bounds for testing bipartiteness in general graphs publication-title: SIAM J. Comput. doi: 10.1137/S0097539703436424 – volume: 11 start-page: 34G38 year: 1959 ident: CR15 article-title: Graph theory and probability publication-title: Can. J. Math. – volume: 23 start-page: 23 issue: 1 year: 2003 end-page: 57 ident: CR25 article-title: Three theorems regarding testing graph properties publication-title: Random Struct. Algorithms doi: 10.1002/rsa.10078 – ident: CR14 – volume: 20 start-page: 184 issue: 2 year: 2002 end-page: 205 ident: CR7 article-title: Testing properties of directed graphs: acyclicity and connectivity publication-title: Random Struct. Algorithms doi: 10.1002/rsa.10023 – ident: CR16 – volume: 41 start-page: 1235 issue: 5 year: 2012 end-page: 1265 ident: CR42 article-title: Distributed verification and hardness of distributed approximation publication-title: SIAM J. Comput. doi: 10.1137/11085178X – ident: CR12 – ident: CR30 – ident: CR10 – ident: CR33 – ident: CR6 – ident: CR29 – volume: 381 start-page: 183 issue: 1–3 year: 2007 end-page: 196 ident: CR36 article-title: Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2007.04.040 – volume: 20 start-page: 481 issue: 4 year: 2011 end-page: 502 ident: CR1 article-title: Many random walks are faster than one publication-title: Comb. Probab. Comput. doi: 10.1017/S0963548311000125 – ident: CR27 – volume: 20 start-page: 165 issue: 2 year: 2002 end-page: 183 ident: CR35 article-title: Testing the diameter of graphs publication-title: Random Struct. Algorithms doi: 10.1002/rsa.10013 – volume: 45 start-page: 653 issue: 4 year: 1998 end-page: 750 ident: CR21 article-title: Property testing and its connection to learning and approximation publication-title: J. ACM doi: 10.1145/285055.285060 – volume: 5 start-page: 73 issue: 2 year: 2009 end-page: 205 ident: CR40 article-title: Algorithmic and analysis techniques in property testing publication-title: Found. Trends Theor. Comput. Sci. doi: 10.1561/0400000029 – volume: 37 start-page: 1703 issue: 6 year: 2008 end-page: 1727 ident: CR4 article-title: A characterization of the (natural) graph properties testable with one-sided error publication-title: SIAM J. Comput. doi: 10.1137/06064888X – ident: CR19 – volume: I start-page: 229 year: 2004 end-page: 264 ident: CR17 article-title: The art of uninformed decisions: a primer to property testing publication-title: Curr. Trends Theor. Compu. Sci. Chall. New Century doi: 10.1142/9789812562494_0014 – volume: 32 start-page: 302 issue: 2 year: 2002 end-page: 343 ident: CR23 article-title: Property testing in bounded degree graphs publication-title: Algorithmica doi: 10.1007/s00453-001-0078-7 – volume: 24 start-page: 79 issue: 2 year: 2011 end-page: 89 ident: CR9 article-title: Distributed discovery of large near-cliques publication-title: Distrib. Comput. doi: 10.1007/s00446-011-0132-x – volume: 15 start-page: 211 issue: 2 year: 2002 end-page: 227 ident: CR3 article-title: Testing k-colorability publication-title: SIAM J. Discrete Math. doi: 10.1137/S0895480199358655 – volume: 60 start-page: 2 issue: 1 year: 2013 ident: CR43 article-title: Distributed random walks publication-title: J. ACM – volume: 47 start-page: 549 issue: 3 year: 1993 end-page: 595 ident: CR8 article-title: Self-testing/correcting with applications to numerical problems publication-title: J. Comput. Syst. Sci. doi: 10.1016/0022-0000(93)90044-W – ident: CR13 – volume: 22 start-page: 786 issue: 2 year: 2008 end-page: 819 ident: CR2 article-title: Testing triangle-freeness in general graphs publication-title: SIAM J. Discrete Math. doi: 10.1137/07067917X – volume: 22 start-page: 215 issue: 4 year: 2010 end-page: 233 ident: CR32 article-title: Proof labeling schemes publication-title: Distrib. Comput. doi: 10.1007/s00446-010-0095-3 – volume: 25 start-page: 252 issue: 2 year: 1996 end-page: 271 ident: CR41 article-title: Robust characterizations of polynomials with applications to program testing publication-title: SIAM J. Comput. doi: 10.1137/S0097539793255151 – ident: CR5 – year: 2005 ident: CR34 publication-title: Probability and Computing-Randomized Algorithms and Probabilistic Analysis doi: 10.1017/CBO9780511813603 – volume: 164 start-page: 51 year: 2006 end-page: 229 ident: CR11 article-title: The strong perfect graph theorem publication-title: Ann. Math. doi: 10.4007/annals.2006.164.51 – ident: CR28 – year: 2000 ident: CR37 publication-title: Distributed Computing: A Locality-Sensitive Approach doi: 10.1137/1.9780898719772 – ident: CR26 – ident: CR24 – ident: CR20 – volume: 1 start-page: 307 issue: 3 year: 2008 end-page: 402 ident: CR39 article-title: Property testing: a learning theory perspective publication-title: Found. Trends Mach. Learn. doi: 10.1561/2200000004 – ident: 324_CR28 doi: 10.1145/2332432.2332504 – volume: 25 start-page: 252 issue: 2 year: 1996 ident: 324_CR41 publication-title: SIAM J. Comput. doi: 10.1137/S0097539793255151 – volume-title: Probability and Computing-Randomized Algorithms and Probabilistic Analysis year: 2005 ident: 324_CR34 doi: 10.1017/CBO9780511813603 – ident: 324_CR10 doi: 10.1145/2767386.2767414 – volume: 381 start-page: 183 issue: 1–3 year: 2007 ident: 324_CR36 publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2007.04.040 – volume: 60 start-page: 2 issue: 1 year: 2013 ident: 324_CR43 publication-title: J. ACM – volume: 5 start-page: 73 issue: 2 year: 2009 ident: 324_CR40 publication-title: Found. Trends Theor. Comput. Sci. doi: 10.1561/0400000029 – volume: 32 start-page: 302 issue: 2 year: 2002 ident: 324_CR23 publication-title: Algorithmica doi: 10.1007/s00453-001-0078-7 – ident: 324_CR18 doi: 10.1145/2833312.2833315 – ident: 324_CR19 – volume: 20 start-page: 184 issue: 2 year: 2002 ident: 324_CR7 publication-title: Random Struct. Algorithms doi: 10.1002/rsa.10023 – ident: 324_CR20 doi: 10.1145/3087801.3087827 – volume: I start-page: 229 year: 2004 ident: 324_CR17 publication-title: Curr. Trends Theor. Compu. Sci. Chall. New Century doi: 10.1142/9789812562494_0014 – volume: 41 start-page: 1235 issue: 5 year: 2012 ident: 324_CR42 publication-title: SIAM J. Comput. doi: 10.1137/11085178X – volume: 20 start-page: 481 issue: 4 year: 2011 ident: 324_CR1 publication-title: Comb. Probab. Comput. doi: 10.1017/S0963548311000125 – volume: 19 start-page: 335 issue: 3 year: 1999 ident: 324_CR22 publication-title: Combinatorica doi: 10.1007/s004930050060 – ident: 324_CR13 doi: 10.1145/2332432.2332443 – ident: 324_CR27 – ident: 324_CR14 doi: 10.1145/2611462.2611493 – ident: 324_CR5 doi: 10.1007/978-3-319-12340-0_2 – volume: 22 start-page: 215 issue: 4 year: 2010 ident: 324_CR32 publication-title: Distrib. Comput. doi: 10.1007/s00446-010-0095-3 – volume-title: Distributed Computing: A Locality-Sensitive Approach year: 2000 ident: 324_CR37 doi: 10.1137/1.9780898719772 – volume: 1 start-page: 307 issue: 3 year: 2008 ident: 324_CR39 publication-title: Found. Trends Mach. Learn. doi: 10.1561/2200000004 – volume: 11 start-page: 34G38 year: 1959 ident: 324_CR15 publication-title: Can. J. Math. – ident: 324_CR33 doi: 10.1145/2484239.2484262 – ident: 324_CR24 doi: 10.1007/978-3-642-16367-8_23 – volume: 24 start-page: 79 issue: 2 year: 2011 ident: 324_CR9 publication-title: Distrib. Comput. doi: 10.1007/s00446-011-0132-x – ident: 324_CR16 – volume: 23 start-page: 23 issue: 1 year: 2003 ident: 324_CR25 publication-title: Random Struct. Algorithms doi: 10.1002/rsa.10078 – volume: 33 start-page: 1441 issue: 6 year: 2004 ident: 324_CR31 publication-title: SIAM J. Comput. doi: 10.1137/S0097539703436424 – ident: 324_CR12 – ident: 324_CR29 doi: 10.1145/3087801.3087811 – volume: 243 start-page: 263 year: 2015 ident: 324_CR38 publication-title: Inf. Comput. doi: 10.1016/j.ic.2014.12.018 – volume: 37 start-page: 1703 issue: 6 year: 2008 ident: 324_CR4 publication-title: SIAM J. Comput. doi: 10.1137/06064888X – ident: 324_CR30 doi: 10.1007/978-3-319-25258-2_26 – volume: 15 start-page: 211 issue: 2 year: 2002 ident: 324_CR3 publication-title: SIAM J. Discrete Math. doi: 10.1137/S0895480199358655 – volume: 47 start-page: 549 issue: 3 year: 1993 ident: 324_CR8 publication-title: J. Comput. Syst. Sci. doi: 10.1016/0022-0000(93)90044-W – ident: 324_CR6 doi: 10.1145/2767386.2767421 – volume: 164 start-page: 51 year: 2006 ident: 324_CR11 publication-title: Ann. Math. doi: 10.4007/annals.2006.164.51 – ident: 324_CR26 doi: 10.1007/978-3-662-53426-7_15 – volume: 20 start-page: 165 issue: 2 year: 2002 ident: 324_CR35 publication-title: Random Struct. Algorithms doi: 10.1002/rsa.10013 – volume: 45 start-page: 653 issue: 4 year: 1998 ident: 324_CR21 publication-title: J. ACM doi: 10.1145/285055.285060 – volume: 22 start-page: 786 issue: 2 year: 2008 ident: 324_CR2 publication-title: SIAM J. Discrete Math. doi: 10.1137/07067917X
SSID	ssj0003112
Score	2.3466673
Snippet	We initiate a thorough study of distributed property testing —producing algorithms for the approximation problems of property testing in the CONGEST model. In... We initiate a thorough study of distributed property testing—producing algorithms for the approximation problems of property testing in the CONGEST model. In...
SourceID	proquest crossref springer
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	41
SubjectTerms	Algorithms Computer Communication Networks Computer Hardware Computer Science Computer Systems Organization and Communication Networks Lower bounds Machinery Model testing Properties (attributes) Run time (computers) Software Engineering/Programming and Operating Systems Task complexity Theory of Computation
SummonAdditionalLinks	– databaseName: SpringerLINK Contemporary 1997-Present dbid: RSV link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3JTsMwEB1B4cCFsopCQT5wAkVy4jR2jghRcaoQm3qLHNsplUpaJYHvx-MmYREgwTmOFY2XeZOZeQ_gVKcpwnobnUgpvZBx7aUqHCCFKPO1BQCcKyc2wUcjMR7HN3Ufd9lUuzcpSXdTt81uLvdoQ19sCQtCT6zCmvV2AvUabu8e2-uX-S7FibLzXsB5m8r8borPzugdYX5JijpfM-z-6yu3YLOGluRiuRe2YcXkO9BtZBtIfYp3QQxlWRGNjLkodmU0kbPJvJhWT88lsRiWVMi8kU-II7MmC_xdXyDv6h48DK_uL6-9WkDBU8yPKi-mOqCB8rk_MBllTEeSGmVCHZpMBtwElMUiSE1sYUGaIdW7iUw6MNZlKYktp_vQyee5OQDCZUa1iYQNKCzm8o0QUqWZ5LGUGVch6wFtLJmoml0cRS5mScuL7CyTWMskaJlE9OCsfWWxpNb4bXC_WZ6kPmVlgsWHPkfGtR6cN8vx4fFPkx3-afQRbFiUFC9LtfvQqYoXcwzr6rWalsWJ23xvd63SZg priority: 102 providerName: Springer Nature
Title	Fast distributed algorithms for testing graph properties
URI	https://link.springer.com/article/10.1007/s00446-018-0324-8 https://www.proquest.com/docview/1993177988
Volume	32
WOSCitedRecordID	wos000456193800003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1432-0452 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0003112 issn: 0178-2770 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LSwMxEB609eDF-sRqLTl4UoL7zu5JVFoEodT6oHhZskm2CnVbu6u_38y-qoJevASWzYZlJsl8ySTfB3AsowhhvV6dcM6pYzNJI-G4SCFqm1IDAMZELjbBBgN_PA6G5YZbWh6rrObEfKKWM4F75Gd40MxkyK51Pn-jqBqF2dVSQmMVmjpQe9jP2ei2noltM892ogI9tRirs5pGQSLq4FoaL5hZDvW_x6Ul2PyRH83DTr_13x_ehI0ScJKLoodswYpKtqFViTmQcmzvgN_naUYk8uiiBJaShE8nur3s-TUlGtmSDPk4kgnJKa7JHDfxF8jGugsP_d791TUtZRWosE0vo4EhLcMSJjNdFRu2LT1uKKEc6aiYW0xZhh34VqQCDRaiGAnglaciV-lAJjheRN2DRjJL1D4QxmNDKs_XywyNxEzl-1xEMWcB5zETjt0GozJqKErOcZS-mIY1W3Luh1D7IUQ_hH4bTupP5gXhxl-VO5Xtw3LspeHS8G04rbz35fVvjR383dghrGuwFBQntjvQyBbv6gjWxEf2ki66ecfrQvOyNxiO9NMNo7ocuk-6HN09fgJPLuHe
linkProvider	ProQuest
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3JTsMwEB2VRYILO6KsPsAFZJHEae0cEEJABSpUHIrUW3BspyBBKU0A8VN8I54sZZHojQPnJFaUNx6_ydjvAWzrKEJab6sTKSX1Gdc0Un4NJUSZqy0B4FxlZhO81RKdTnBVgffyLAxuqyxzYpao9aPCf-T7uNHM5aiuddh_ougahd3V0kIjD4umeXu1JVtycH5i8d3xvMZp-_iMFq4CVDG3ntLA0bbgVy53ayZ2GNN16RhlfO2bWHrceA4LhBeZwK6VUYz656ZuopqxeVxJPIdpxx2DCZ8JjvOqyekw8zM3666i4z31OB92UZ1ctNTH2h0PtHk-Fd_XwU9y-6Mfmy1zjdn_9oHmYKYg1OQonwHzUDG9BZgtzSpIkbsWQTRkkhKNOsFo8WU0kfdd-_7p7UNCLHMnKeqN9Lokk_AmfWxSDFBtdgmu_-T9l2G899gzK0C4jB1t6sKWUZZpukYIqaJY8kDKmCufVcEpQQxVoamO1h734VANOsM9tLiHiHsoqrA7fKSfC4qMunm9xDoscksSfgJdhb0yWr5c_m2w1dGDbcHUWfvyIrw4bzXXYNoSwyDfnb4O4-ng2WzApHpJ75LBZhb0BG7-Oog-AKiuOY4
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS8NAEB5qFfFifWK16h70ooTm1W5yEBFrUZTSg4J4iZvdTRW01iYq_jV_nTN5tCrorQfPSZYl82UemdnvA9hRYUhpPVYnQgjDdbgyQuk2iELUsRQmAJzLVGyCdzre9bXfLcFHcRaGxioLn5g6avUk6R95nQbNLE7sWvUoH4vottqHg2eDFKSo01rIaWQQOdfvb1i-xQdnLbT1rm23Ty6PT41cYcCQjtVMDN9UWPxLi1sNHZmOo5rC1FK7ytWRsLm2Tcf37FD7GDfDiLjQdVOHDY0-XQo6k4nrTsE0xxqTxgm7jZtRFHCstNOKgEckcj7qqJoZgalLdTwdbrNdw_seE8eJ7o_ebBry2pX__LIWYD5PtNlR9mUsQkn3l6BSiFiw3Kctg9cWccIU8QeT9JdWTDz0cP_J3WPMMKNnCfGQ9HsspfZmA2peDImFdgWuJrL_VSj3n_p6DRgXkal008PyCjNQS3uekGEkuC9ExKXrVMEsDBrInGudJD8eghFLdIqBADEQEAYCrwp7o0cGGdHIXzfXCrsHuc-Jg7HRq7BfIOfL5d8WW_97sW2YRewEF2ed8w2Yw3zRz4bWa1BOhi96E2bka3IfD7dS_DO4nTSGPgFIZ0Ky
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Fast+distributed+algorithms+for+testing+graph+properties&rft.jtitle=Distributed+computing&rft.au=Censor-Hillel%2C+Keren&rft.au=Fischer%2C+Eldar&rft.au=Schwartzman%2C+Gregory&rft.au=Vasudev%2C+Yadu&rft.date=2019-02-01&rft.pub=Springer+Nature+B.V&rft.issn=0178-2770&rft.eissn=1432-0452&rft.volume=32&rft.issue=1&rft.spage=41&rft.epage=57&rft_id=info:doi/10.1007%2Fs00446-018-0324-8&rft.externalDBID=HAS_PDF_LINK
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0178-2770&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0178-2770&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0178-2770&client=summon