Graph Property Testing
Graph Property Testing is a computational framework within sublinear algorithms that distinguishes whether a graph satisfies a fixed property or is far from satisfying it by examining only a small portion of the graph.
131
Publications
10.9K
Citations
170
Authors
106
Institutions
Publications per year
2017–2026
14
Parents
131
Property testing and its connection to learning and approximation
Oded Goldreich, Shari Goldwasser, Dana Ron · Journal of the ACM · 1998 · 1.1K citations · Full text
Haichuan Shang, Ying Zhang, Xuemin Lin et al. · Proceedings of the VLDB Endowment · 2008 · 392 citations
1–5 of 131
170
17
h-index
14
h-index
14
h-index
14
h-index
11
h-index
1–5 of 170
106

Tel Aviv University
Tel Aviv, Israel
22 h-index
57 publications
3.9K citations

Weizmann Institute of Science
Rehovot, Israel
11 h-index
15 publications
3.7K citations
Princeton University
Princeton, United States
11 h-index
15 publications
1.1K citations
Technion – Israel Institute of Technology
Haifa, Israel
10 h-index
18 publications
634 citations
University of Haifa
Haifa, Israel
9 h-index
11 publications
573 citations
TU Dortmund University
Dortmund, Germany
8 h-index
13 publications
370 citations

University of Warwick
Coventry, United Kingdom
7 h-index
7 publications
276 citations
Georgia Institute of Technology
Atlanta, United States
7 h-index
7 publications
298 citations
1–8 of 106
17 publications · 2.1K citations
16
h-index
11 publications · 670 citations
11
h-index
Repository · 5 publications · 147 citations
5
h-index
5 publications · 383 citations
5
h-index
4 publications · 65 citations
4
h-index
1–5