Minimum Cut
Minimum Cut is a partition of the vertices of a flow network into two disjoint subsets such that the sum of the capacities of the edges crossing from the subset containing the source to the subset containing the sink is minimized.
593
Publications
41.9K
Citations
1.2K
Authors
537
Institutions
Publications per year
2017–2026
85
593
1–5 of 593
1.2K
12
h-index
10
h-index
8
h-index
7
h-index
7
h-index
1–5 of 1.2K
537
University of California, Berkeley
Berkeley, United States
21 h-index
39 publications
3.1K citations
Massachusetts Institute of Technology
Cambridge, United States
17 h-index
34 publications
3.2K citations
Carnegie Mellon University
Pittsburgh, United States
13 h-index
24 publications
1.8K citations

Cornell University
Ithaca, United States
12 h-index
28 publications
8.4K citations
Princeton University
Princeton, United States
10 h-index
15 publications
2.9K citations
ETH Zurich
Zurich, Switzerland
10 h-index
19 publications
317 citations

Centre National de la Recherche Scientifique
Paris, France
9 h-index
16 publications
619 citations
The University of Texas at Austin
Austin, United States
9 h-index
15 publications
1.9K citations
1–8 of 537
23 publications · 3.8K citations
22
h-index
14 publications · 664 citations
13
h-index
14 publications · 471 citations
13
h-index
18 publications · 875 citations
13
h-index
13 publications · 737 citations
12
h-index
1–5