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

Authors

1.2K

  1. DS
    Dorit S. Hochbaum

    University of California, Berkeley, United States

    14 publications · 1.2K citations

    12

    h-index

  2. DR
    David R. Karger

    Massachusetts Institute of Technology, United States

    11 publications · 1.1K citations

    10

    h-index

  3. HN
    Hiroshi Nagamochi

    Kyoto University, Japan

    8 publications · 308 citations

    8

    h-index

  4. JN
    Joseph Naor

    Technion – Israel Institute of Technology, Israel

    7 publications · 264 citations

    7

    h-index

  5. CC
    Chandra Chekuri

    University of Illinois Urbana-Champaign, United States

    7 publications · 140 citations

    7

    h-index

1–5 of 1.2K

Venues

  1. SIAM Journal on Computing

    23 publications · 3.8K citations

    22

    h-index

  2. Mathematical Programming

    14 publications · 664 citations

    13

    h-index

  3. Algorithmica

    14 publications · 471 citations

    13

    h-index

  4. Networks

    18 publications · 875 citations

    13

    h-index

  5. IEEE Transactions on Reliability

    13 publications · 737 citations

    12

    h-index

1–5