Matching Problems

Matching Problems is a combinatorial optimization problem in which the objective is to find a subset of edges in a graph such that no two edges share a common vertex, thereby forming a maximum or optimal independent set of pairings under specific constraints.

1.9K

Publications

108.8K

Citations

3K

Authors

1K

Institutions

Publications per year

2017–2026

344

Authors

3K

  1. EC
    Eddie Cheng

    Oakland University, United States

    21 publications · 742 citations

    17

    h-index

  2. RW
    Robert W. Irving

    University of Glasgow, United Kingdom

    16 publications · 1.1K citations

    16

    h-index

  3. JY
    Junchi Yan

    Shanghai Jiao Tong University, China

    15 publications · 1K citations

    14

    h-index

  4. TK
    Telikepalli Kavitha

    Tata Institute of Fundamental Research, India

    19 publications · 644 citations

    14

    h-index

  5. ER
    Edwin R. Hancock

    University of York, United Kingdom

    14 publications · 915 citations

    13

    h-index

1–5 of 3K

Venues

  1. IEEE Transactions on Pattern Analysis and Machine Intelligence

    TPAMI · 33 publications · 7.1K citations

    30

    h-index

  2. SIAM Journal on Computing

    41 publications · 9.4K citations

    30

    h-index

  3. Discrete Mathematics

    71 publications · 2.4K citations

    29

    h-index

  4. Discrete Applied Mathematics

    55 publications · 2.4K citations

    28

    h-index

  5. Information Processing Letters

    39 publications · 2.3K citations

    23

    h-index

1–5