Graph Isomorphism
Graph Isomorphism is a binary relation between two graphs that preserves adjacency and non-adjacency through a bijective mapping between their vertex sets, establishing structural equivalence.
1.5K
Publications
84.8K
Citations
2.6K
Authors
999
Institutions
Publications per year
2017–2026
235
Parents
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
Weisfeiler and Leman Go Neural: Higher-Order Graph Neural Networks
Christopher Morris, Martin Ritzert, Matthias Fey et al. · 2019 · 1.2K citations
1–5 of 1.5K
2.6K
19
h-index
17
h-index
17
h-index
14
h-index
12
h-index
1–5 of 2.6K
999
Simon Fraser University
Burnaby, Canada
20 h-index
36 publications
1.5K citations

University of Ljubljana
Ljubljana, Slovenia
19 h-index
47 publications
1.7K citations

The University of Western Australia
Perth, Australia
19 h-index
49 publications
1.8K citations

Centre National de la Recherche Scientifique
Paris, France
17 h-index
32 publications
1.2K citations

Eötvös Loránd University
Budapest, Hungary
16 h-index
24 publications
2.8K citations
Massachusetts Institute of Technology
Cambridge, United States
16 h-index
25 publications
2.1K citations

University of Waterloo
Waterloo, Canada
15 h-index
25 publications
1.9K citations
RWTH Aachen University
Aachen, Germany
14 h-index
44 publications
4.8K citations
1–8 of 999
105 publications · 3.4K citations
33
h-index
67 publications · 3K citations
31
h-index
69 publications · 2.9K citations
28
h-index
42 publications · 2.1K citations
28
h-index
24 publications · 2.4K citations
21
h-index
1–5