Graph Partitioning

Graph Partitioning is a combinatorial optimization problem that involves dividing the vertex set of a graph into mutually disjoint subsets according to a specific objective function, distinguished by the requirement to minimize the number of edges between partitions while maintaining a balance constraint on subset sizes.

1.4K

Publications

119.9K

Citations

3K

Authors

1K

Institutions

Publications per year

2017–2026

267

Authors

3K

  1. GK
    George Karypis

    University of Minnesota, United States

    30 publications · 13.5K citations

    25

    h-index

  2. VK
    Vipin Kumar

    University of Minnesota, United States

    19 publications · 12.8K citations

    18

    h-index

  3. AB
    Andrew B. Kahng

    University of California San Diego, United States

    15 publications · 538 citations

    13

    h-index

  4. ST
    Shang‐Hua Teng

    University of Southern California, United States

    10 publications · 2.1K citations

    10

    h-index

  5. NA
    Noga Alon

    Tel Aviv University, Israel

    10 publications · 939 citations

    10

    h-index

1–5 of 3K

Venues

  1. arXiv (Cornell University)

    Repository · 37 publications · 1K citations

    19

    h-index

  2. Discrete Mathematics

    38 publications · 892 citations

    18

    h-index

  3. Discrete Applied Mathematics

    32 publications · 1.2K citations

    18

    h-index

  4. SIAM Journal on Scientific Computing

    18 publications · 7.3K citations

    16

    h-index

  5. Theoretical Computer Science

    23 publications · 757 citations

    16

    h-index

1–5