TY - GEN

T1 - Approximately Counting Triangles in Sublinear Time

AU - Eden, Talya

AU - Levi, Amit

AU - Ron, Dana

AU - Seshadhri, C.

N1 - Publisher Copyright:
© 2015 IEEE.

PY - 2015/12/11

Y1 - 2015/12/11

N2 - We consider the problem of estimating the number of triangles in a graph. This problem has been extensively studied in both theory and practice, but all existing algorithms read the entire graph. In this work we design a sub linear-time algorithm for approximating the number of triangles in a graph, where the algorithm is given query access to the graph. The allowed queries are degree queries, vertex-pair queries and neighbor queries. We show that for any given approximation parameter 0

AB - We consider the problem of estimating the number of triangles in a graph. This problem has been extensively studied in both theory and practice, but all existing algorithms read the entire graph. In this work we design a sub linear-time algorithm for approximating the number of triangles in a graph, where the algorithm is given query access to the graph. The allowed queries are degree queries, vertex-pair queries and neighbor queries. We show that for any given approximation parameter 0

KW - Sublinear Approximation Algorithm

KW - Triangles Counting

UR - http://www.scopus.com/inward/record.url?scp=84960333832&partnerID=8YFLogxK

U2 - 10.1109/FOCS.2015.44

DO - 10.1109/FOCS.2015.44

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84960333832

T3 - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

SP - 614

EP - 633

BT - Proceedings - 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015

PB - IEEE Computer Society

T2 - 56th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2015

Y2 - 17 October 2015 through 20 October 2015

ER -