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
1.4K
Yair Weiss, Antonio Torralba, Rob Fergus · neural information processing systems · 2008 · 2.1K citations
1–5 of 1.4K
3K
25
h-index
18
h-index
13
h-index
10
h-index
10
h-index
1–5 of 3K
1K
University of California, Berkeley
Berkeley, United States
25 h-index
42 publications
28.4K citations

University of Minnesota
Minneapolis, United States
23 h-index
55 publications
13.5K citations
Carnegie Mellon University
Pittsburgh, United States
21 h-index
44 publications
25K citations
Georgia Institute of Technology
Atlanta, United States
20 h-index
53 publications
4.5K citations
Microsoft (United States)
Redmond, United States
19 h-index
35 publications
3.9K citations

Pennsylvania State University
State College, United States
18 h-index
28 publications
4.5K citations

University of Waterloo
Waterloo, Canada
17 h-index
30 publications
1.9K citations

Centre National de la Recherche Scientifique
Paris, France
16 h-index
47 publications
1.2K citations
1–8 of 1K
Repository · 37 publications · 1K citations
19
h-index
38 publications · 892 citations
18
h-index
32 publications · 1.2K citations
18
h-index
18 publications · 7.3K citations
16
h-index
23 publications · 757 citations
16
h-index
1–5