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
1.5K
An Algorithm for Subgraph Isomorphism
J. R. Ullmann · Journal of the ACM · 1976 · 2.3K citations · Full text
Practical graph isomorphism, II
Brendan D. McKay, Adolfo Piperno · Journal of Symbolic Computation · 2013 · 1.6K citations
M. Kuramochi, George Karypis · 2002 · 1.1K citations · Full text
1–5 of 1.5K
2.8K
15
h-index
14
h-index
13
h-index
11
h-index
11
h-index
1–5 of 2.8K
1K

University of Waterloo
Waterloo, Canada
22 h-index
45 publications
2.5K citations

Centre National de la Recherche Scientifique
Paris, France
18 h-index
46 publications
2K citations

Tel Aviv University
Tel Aviv, Israel
17 h-index
31 publications
1.3K citations

Hungarian Academy of Sciences
Budapest, Hungary
17 h-index
38 publications
1.9K citations
Massachusetts Institute of Technology
Cambridge, United States
16 h-index
24 publications
1.2K citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
15 h-index
35 publications
2.8K citations
Charles University
Prague, Czechia
14 h-index
19 publications
757 citations
RWTH Aachen University
Aachen, Germany
14 h-index
38 publications
849 citations
1–8 of 1K
86 publications · 4.3K citations
33
h-index
102 publications · 3K citations
30
h-index
PVLDB · 26 publications · 3.2K citations
25
h-index
51 publications · 1.5K citations
23
h-index
24 publications · 2.8K citations
21
h-index
1–5