Concepedia

Graph Partitioning Approximation

Graph Partitioning Approximation is an algorithmic framework in the field of approximation algorithms that addresses the problem of partitioning a graph into disjoint subsets with specified balance and connectivity constraints while approximately minimizing or maximizing a given objective function such as cut size or modularity.

177

Publications

12.8K

Citations

387

Authors

183

Institutions

Publications per year

2017–2026

33

Parents

Publications

177

A Separator Theorem for Planar Graphs

Richard J. Lipton, Robert E. Tarjan · SIAM Journal on Applied Mathematics · 1979 · 1.4K citations

, , +13

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

, , +14

Local Graph Partitioning using PageRank Vectors

Reid Andersen, Fan Chung, Kevin Lang · 2006 · 985 citations

, , +12

Dividing a Graph into Triconnected Components

John E. Hopcroft, Robert E. Tarjan · SIAM Journal on Computing · 1973 · 841 citations

, , +8

Balanced Graph Partitioning

Konstantin Andreev, Harald Räcke · Theory of Computing Systems · 2006 · 364 citations

, , +11

1–5 of 177

Authors

387

  1. UF
    Uriel Feige

    Weizmann Institute of Science, Israel

    7 publications · 476 citations

    7

    h-index

  2. RK
    Robert Krauthgamer

    Weizmann Institute of Science, Israel

    6 publications · 314 citations

    6

    h-index

  3. KM
    Konstantin Makarychev

    Microsoft (United States), United States

    5 publications · 155 citations

    5

    h-index

  4. JN
    Joseph Naor

    Technion – Israel Institute of Technology, Israel

    4 publications · 234 citations

    4

    h-index

  5. LT
    Luca Trevisan

    University of California, Berkeley, United States

    4 publications · 226 citations

    4

    h-index

1–5 of 387

Institutions

183

  1. University of California, Berkeley

    Berkeley, United States

    10 h-index

    15 publications

    2.8K citations

  2. Microsoft (United States)

    Redmond, United States

    8 h-index

    12 publications

    1.3K citations

  3. Tel Aviv University

    Tel Aviv, Israel

    6 h-index

    11 publications

    964 citations

  4. Princeton University

    Princeton, United States

    6 h-index

    6 publications

    340 citations

  5. Weizmann Institute of Science

    Rehovot, Israel

    6 h-index

    11 publications

    2.8K citations

  6. Technion – Israel Institute of Technology

    Haifa, Israel

    6 h-index

    8 publications

    328 citations

  7. IBM (United States)

    Armonk, United States

    6 h-index

    7 publications

    409 citations

  8. Centre National de la Recherche Scientifique

    Paris, France

    5 h-index

    10 publications

    263 citations

1–8 of 183

Venues

  1. SIAM Journal on Computing

    9 publications · 1.6K citations

    9

    h-index

  2. arXiv (Cornell University)

    Repository · 7 publications · 235 citations

    7

    h-index

  3. Journal of Combinatorial Theory Series B

    6 publications · 299 citations

    6

    h-index

  4. Discrete Mathematics

    6 publications · 109 citations

    6

    h-index

  5. Discrete Applied Mathematics

    5 publications · 108 citations

    5

    h-index

1–5