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

Authors

41

  1. FF
    Frédéric Fürst

    Nantes Université, France

    2 publications · 35 citations

    2

    h-index

  2. AK
    AbdelGhani Karkar

    Qatar University, Qatar

    1 publications · 14 citations

    1

    h-index

  3. DD
    Denis Delamarre

    Département d'Informatique, France

    1 publications · 22 citations

    1

    h-index

  4. MR
    Miia Rantala

    Aalto University, Finland

    1 publications · 19 citations

    1

    h-index

  5. HT
    Hsiao-Rong Tyan

    Chung Yuan Christian University, Taiwan

    1 publications · 17 citations

    1

    h-index

1–5 of 41

Venues

  1. IEEE Transactions on Learning Technologies

    1 publications · 30 citations

    1

    h-index

  2. 1

    h-index

  3. IEEE Access

    1 publications · 14 citations

    1

    h-index

  4. International Journal of Intelligent Systems

    1 publications · 12 citations

    1

    h-index

  5. Computers in Industry

    1 publications · 19 citations

    1

    h-index

1–5