Subgraph Isomorphism

Subgraph Isomorphism is a computational problem in graph theory that determines whether a given graph contains a subgraph isomorphic to a specified pattern graph, establishing a vertex- and edge-preserving bijection between the pattern and any substructure of the target graph.

1.5K

Publications

85.6K

Citations

2.8K

Authors

1K

Institutions

Publications per year

2017–2026

277

Variants

Subgraph Isomorphism Problem

Authors

2.8K

  1. LB
    László Babai

    University of Chicago, United States

    18 publications · 1.6K citations

    15

    h-index

  2. MG
    Martin Grohe

    Humboldt-Universität zu Berlin, Germany

    19 publications · 666 citations

    14

    h-index

  3. WF
    Wenfei Fan

    University of Edinburgh, United Kingdom

    13 publications · 1.3K citations

    13

    h-index

  4. AL
    Andrzej Lingas

    Lund University, Sweden

    11 publications · 252 citations

    11

    h-index

  5. XL
    Xuemin Lin

    UNSW Sydney, Australia

    12 publications · 1.2K citations

    11

    h-index

1–5 of 2.8K

Venues

  1. Journal of Graph Theory

    86 publications · 4.3K citations

    33

    h-index

  2. Discrete Mathematics

    102 publications · 3K citations

    30

    h-index

  3. Proceedings of the VLDB Endowment

    PVLDB · 26 publications · 3.2K citations

    25

    h-index

  4. Journal of Combinatorial Theory Series B

    51 publications · 1.5K citations

    23

    h-index

  5. SIAM Journal on Computing

    24 publications · 2.8K citations

    21

    h-index

1–5