Testing triangle-freeness in general graphs | fatcat!

by Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron

Cited By

References to this release by other works.

Read more about quality, completeness, and caveats in the fatcat guide.

Showing 1 - 12 of 12 references (in 97ms)
via crossref	Tight Security for Key-Alternating Ciphers with Correlated Sub-keys [chapter] Stefano Tessaro, Xihu Zhang 2021 Lecture Notes in Computer Science doi:10.1007/978-3-030-92078-4_15
via crossref	On the Multiparty Communication Complexity of Testing Triangle-Freeness Orr Fischer, Shay Gershtein, Rotem Oshman 2017 ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing doi:10.1145/3087801.3087821 dblp:conf/podc/FischerGO17
via grobid	Sparse instances of hard problems [article] Holger Dell, Humboldt-Universität Zu Berlin, Humboldt-Universität Zu Berlin 2017 doi:10.18452/16375	web.archive.org [PDF]
via crossref	Principles of Network Computing [chapter] Yicheng Pan 2012 Lecture Notes in Computer Science doi:10.1007/978-3-642-29952-0_9
via crossref	Comparing the strength of query types in property testing: The case of k-colorability Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron 2012 Computational Complexity doi:10.1007/s00037-012-0048-2
via crossref	Testing the <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mrow><mml:mo>(</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-disconnectivity of graphs and digraphs Yuichi Yoshida, Yusuke Kobayashi 2012 Theoretical Computer Science doi:10.1016/j.tcs.2012.01.045	web.archive.org [PDF]
via crossref	Introduction to Testing Graph Properties [chapter] Oded Goldreich 2011 Lecture Notes in Computer Science doi:10.1007/978-3-642-22670-0_32	web.archive.org [PDF]
via crossref	Introduction to Testing Graph Properties [chapter] Oded Goldreich 2010 Lecture Notes in Computer Science doi:10.1007/978-3-642-16367-8_7	web.archive.org [PDF]
via crossref	Distribution-Free Connectivity Testing for Sparse Graphs Shirley Halevy, Eyal Kushilevitz 2007 Algorithmica doi:10.1007/s00453-007-9054-1
via crossref	Testing st-Connectivity [chapter] Sourav Chakraborty, Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman 2007 Lecture Notes in Computer Science doi:10.1007/978-3-540-74208-1_28	web.archive.org [PDF]
via crossref	Distance Approximation in Bounded-Degree and General Sparse Graphs [chapter] Sharon Marko, Dana Ron 2006 Lecture Notes in Computer Science doi:10.1007/11830924_43	web.archive.org [PDF]
via crossref	Large Scale Graph Mining with MapReduce [chapter] Charalampos E. Tsourakakis Advances in Data Mining and Database Management doi:10.4018/978-1-61350-053-8.ch013
JSON