Graph Optimization

Graph Optimization is a discrete optimization problem that involves finding an optimal configuration or structure within a graph, distinguished by its focus on optimizing objective functions defined over vertices, edges, or subgraphs subject to combinatorial constraints.

1.1K

Publications

70.2K

Citations

2.9K

Authors

927

Institutions

Publications per year

2017–2026

404

Authors

2.9K

  1. VM
    Vahab Mirrokni

    Google (United States), United States

    8 publications · 1.2K citations

    8

    h-index

  2. FN
    Feiping Nie

    Northwestern Polytechnical University, China

    7 publications · 660 citations

    7

    h-index

  3. SB
    Sergiy Butenko

    Texas A&M University, United States

    7 publications · 430 citations

    7

    h-index

  4. MP
    Marcello Pelillo

    Ca' Foscari University of Venice, Italy

    7 publications · 931 citations

    7

    h-index

  5. LC
    Luca Carlone

    Massachusetts Institute of Technology, United States

    7 publications · 817 citations

    7

    h-index

1–5 of 2.9K

Venues

  1. arXiv (Cornell University)

    Repository · 45 publications · 2.8K citations

    21

    h-index

  2. Networks

    32 publications · 1.9K citations

    21

    h-index

  3. SIAM Journal on Discrete Mathematics

    19 publications · 691 citations

    15

    h-index

  4. IEEE Transactions on Pattern Analysis and Machine Intelligence

    TPAMI · 15 publications · 2.3K citations

    15

    h-index

  5. Discrete Applied Mathematics

    18 publications · 870 citations

    15

    h-index

1–5