Concepedia

Cut Algorithms

Cut Algorithms is a class of graph algorithms that identify and compute minimal edge separations, or cuts, which partition a graph into disjoint subsets while minimizing the total weight of edges removed, thereby solving connectivity and flow optimization problems in networks.

805

Publications

54K

Citations

1.6K

Authors

661

Institutions

Publications per year

2017–2026

113

Parents

Publications

805

An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision

Yuri Boykov, Vladimir Kolmogorov · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2004 · 4.6K citations

, , +11

What energy functions can be minimized via graph cuts?

Vladimir Kolmogorov, Ramin Zabih · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2004 · 3.1K citations

, , +8

Graph Cuts and Efficient N-D Image Segmentation

Yuri Boykov, Gareth Funka-Lea · International Journal of Computer Vision · 2006 · 1.9K citations

, , +10

New spectral methods for ratio cut partitioning and clustering

L. Hagen, Andrew B. Kahng · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · 1992 · 1.3K citations

, , +15

Computing visual correspondence with occlusions using graph cuts

Vladimir Kolmogorov, Ramin Zabih · 2002 · 1.1K citations

, , +14

1–5 of 805

Authors

1.6K

  1. HN
    Hiroshi Nagamochi

    Kyoto University, Japan

    8 publications · 314 citations

    10

    h-index

  2. DS
    Dorit S. Hochbaum

    University of California, Berkeley, United States

    9 publications · 749 citations

    9

    h-index

  3. DR
    David R. Karger

    Massachusetts Institute of Technology, United States

    9 publications · 942 citations

    9

    h-index

  4. ST
    S. Thomas McCormick

    University of British Columbia, Canada

    8 publications · 208 citations

    8

    h-index

  5. SR
    Satish Rao

    University of California, Berkeley, United States

    8 publications · 989 citations

    8

    h-index

1–5 of 1.6K

Institutions

661

  1. University of California, Berkeley

    Berkeley, United States

    21 h-index

    45 publications

    7K citations

  2. Princeton University

    Princeton, United States

    20 h-index

    30 publications

    4.9K citations

  3. Carnegie Mellon University

    Pittsburgh, United States

    18 h-index

    44 publications

    2.2K citations

  4. Massachusetts Institute of Technology

    Cambridge, United States

    16 h-index

    27 publications

    2.4K citations

  5. Centre National de la Recherche Scientifique

    Paris, France

    14 h-index

    29 publications

    766 citations

  6. Georgia Institute of Technology

    Atlanta, United States

    14 h-index

    29 publications

    2.4K citations

  7. Microsoft (United States)

    Redmond, United States

    13 h-index

    23 publications

    2.6K citations

  8. Tel Aviv University

    Tel Aviv, Israel

    13 h-index

    20 publications

    1.1K citations

1–8 of 661

Venues

  1. Mathematical Programming

    42 publications · 2.4K citations

    27

    h-index

  2. SIAM Journal on Computing

    26 publications · 3.1K citations

    23

    h-index

  3. European Journal of Operational Research

    25 publications · 1.1K citations

    20

    h-index

  4. Algorithmica

    23 publications · 1.1K citations

    16

    h-index

  5. Networks

    14 publications · 677 citations

    12

    h-index

1–5