Concepedia

Graph Matching

Graph Matching is a computational problem in graph theory that seeks to find a mapping between the vertices of two graphs such that the induced structural correspondence maximizes the alignment of edges, differing from related tasks by emphasizing pairwise node associations to preserve topological consistency.

2.2K

Publications

132.2K

Citations

4.5K

Authors

1.3K

Institutions

Publications per year

2017–2026

536

Variants

Graph Alignment

Parents

Publications

2.2K

An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

John E. Hopcroft, Richard M. Karp · SIAM Journal on Computing · 1973 · 2.8K citations

, , +15

Paths, Trees, and Flowers

Jack Edmonds · Canadian Journal of Mathematics · 1965 · 2.4K citations · Full text

, , +16

Distortion invariant object recognition in the dynamic link architecture

Martin Lades, Jan C. Vorbrüggen, Joachim M. Buhmann et al. · IEEE Transactions on Computers · 1993 · 1.8K citations

, , +16

Practical graph isomorphism, II

Brendan D. McKay, Adolfo Piperno · Journal of Symbolic Computation · 2013 · 1.6K citations

, , +10

A (sub)graph isomorphism algorithm for matching large graphs

L.P. Cordella, Pasquale Foggia, Carlo Sansone et al. · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2004 · 1.5K citations

, , +13

1–5 of 2.2K

Authors

4.5K

  1. ER
    Edwin R. Hancock

    University of York, United Kingdom

    37 publications · 2.4K citations

    24

    h-index

  2. HB
    Horst Bunke

    University of Bern, Switzerland

    21 publications · 3.1K citations

    18

    h-index

  3. XL
    Xuemin Lin

    UNSW Sydney, Australia

    21 publications · 1.2K citations

    17

    h-index

  4. PF
    Pasquale Foggia

    University of Salerno, Italy

    16 publications · 4.6K citations

    16

    h-index

  5. EC
    Eddie Cheng

    Oakland University, United States

    19 publications · 583 citations

    16

    h-index

1–5 of 4.5K

Institutions

1.3K

  1. Carnegie Mellon University

    Pittsburgh, United States

    28 h-index

    70 publications

    7.8K citations

  2. University of York

    York, United Kingdom

    26 h-index

    80 publications

    4.7K citations

  3. Centre National de la Recherche Scientifique

    Paris, France

    25 h-index

    89 publications

    4.7K citations

  4. Tel Aviv University

    Tel Aviv, Israel

    23 h-index

    57 publications

    2.3K citations

  5. University of Waterloo

    Waterloo, Canada

    23 h-index

    47 publications

    2.2K citations

  6. Stanford University

    Stanford, United States

    22 h-index

    53 publications

    6.1K citations

  7. University of Michigan

    Ann Arbor, United States

    22 h-index

    46 publications

    4.5K citations

  8. Georgia Institute of Technology

    Atlanta, United States

    22 h-index

    35 publications

    2K citations

1–8 of 1.3K

Venues

  1. 47

    h-index

  2. Discrete Applied Mathematics

    55 publications · 2.1K citations

    27

    h-index

  3. Discrete Mathematics

    68 publications · 2.2K citations

    26

    h-index

  4. Pattern Recognition

    40 publications · 1.8K citations

    24

    h-index

  5. arXiv (Cornell University)

    Repository · 77 publications · 2.8K citations

    24

    h-index

1–5