@inproceedings{1280969f79da491e9be96ec2bcca3812,

title = "Approximately Counting Triangles in Sublinear Time",

abstract = "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 ",

keywords = "Sublinear Approximation Algorithm, Triangles Counting",

author = "Talya Eden and Amit Levi and Dana Ron and C. Seshadhri",

note = "Publisher Copyright: {\textcopyright} 2015 IEEE.; 56th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2015 ; Conference date: 17-10-2015 Through 20-10-2015",

year = "2015",

month = dec,

day = "11",

doi = "https://doi.org/10.1109/FOCS.2015.44",

language = "الإنجليزيّة",

series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",

publisher = "IEEE Computer Society",

pages = "614--633",

booktitle = "Proceedings - 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015",

address = "الولايات المتّحدة",

}