Conceptual Graph Matching
Conceptual Graph Matching is a formal method in knowledge representation that identifies structural correspondences between two conceptual graphs by aligning their concepts and relations according to semantic compatibility and graph isomorphism constraints.
14
Publications
320
Citations
41
Authors
24
Institutions
Publications per year
2017–2026
2
Parents
14
1–5 of 14
41
2
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 41
24
Université Paris-Sud
Orsay, France
2 h-index
2 publications
35 citations

Centre National de la Recherche Scientifique
Paris, France
2 h-index
3 publications
48 citations

Nantes Université
Nantes, France
2 h-index
2 publications
35 citations

The University of Sydney
Sydney, Australia
1 h-index
4 publications
120 citations
University of Arizona
Tucson, United States
1 h-index
2 publications
22 citations
Chung Yuan Christian University
Taoyuan City, Taiwan
1 h-index
2 publications
34 citations

University of Waterloo
Waterloo, Canada
1 h-index
2 publications
24 citations
National Taiwan University of Science and Technology
Taipei, Taiwan
1 h-index
6 publications
102 citations
1–8 of 24
1 publications · 30 citations
1
h-index
JETAI · 1 publications · 42 citations
1
h-index
1 publications · 14 citations
1
h-index
1 publications · 12 citations
1
h-index
1 publications · 19 citations
1
h-index
1–5