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

Authors

170

  1. NA
    Noga Alon

    Tel Aviv University, Israel

    20 publications · 1.6K citations

    17

    h-index

  2. EF
    Eldar Fischer

    Technion – Israel Institute of Technology, Israel

    15 publications · 1.1K citations

    14

    h-index

  3. AS
    A. Shapira

    Weizmann Institute of Science, Israel

    15 publications · 1.1K citations

    14

    h-index

  4. DR
    Dana Ron

    Tel Aviv University, Israel

    16 publications · 1.9K citations

    14

    h-index

  5. OG
    Oded Goldreich

    Weizmann Institute of Science, Israel

    12 publications · 2.2K citations

    11

    h-index

1–5 of 170

Venues

  1. SIAM Journal on Computing

    17 publications · 2.1K citations

    16

    h-index

  2. Random Structures and Algorithms

    11 publications · 670 citations

    11

    h-index

  3. arXiv (Cornell University)

    Repository · 5 publications · 147 citations

    5

    h-index

  4. Algorithmica

    5 publications · 383 citations

    5

    h-index

  5. 4

    h-index

1–5