From exact to approximate maximum common subgraph

被引：0
|
作者：
Marini, S [1 ]
Spagnuolo, M [1 ]
Falcidieno, B [1 ]
机构：
[1] CNR, Ist Matemat Applicata & Tecnol Informat, I-16149 Genoa, Italy
来源：
GRAPH-BASED REPRESENTATIONS IN PATTERN RECOGNITION, PROCEEDINGS | 2005年 / 3434卷
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
This paper presents an algorithm for the computation of the maximum common subgraph (MCS) between two directed, acyclic graphs with attributes. The core of the contribution resides in the modularity of the proposed algorithm which allows different heuristic techniques to be plugged in, depending on the application domain. Implemented heuristics for robust graph matching with respect to graph structural noise are discussed. As example of its effectiveness, the algortihm is applied to the problem of 3D shape similarity evaluation through structural shape descriptors.
引用
收藏
页码：263 / 272
页数：10
相关论文
共 50 条
  • [21] Polyhedral study of the maximum common induced subgraph problem
    Breno Piva
    Cid Carvalho de Souza
    Annals of Operations Research, 2012, 199 : 77 - 102
  • [22] Effective feature construction by maximum common subgraph sampling
    Leander Schietgat
    Fabrizio Costa
    Jan Ramon
    Luc De Raedt
    Machine Learning, 2011, 83 : 137 - 161
  • [23] Polyhedral study of the maximum common induced subgraph problem
    Piva, Breno
    de Souza, Cid Carvalho
    ANNALS OF OPERATIONS RESEARCH, 2012, 199 (01) : 77 - 102
  • [24] The maximum common edge subgraph problem: A polyhedral investigation
    Bahiense, Laura
    Manic, Gordana
    Piva, Breno
    de Souza, Cid C.
    DISCRETE APPLIED MATHEMATICS, 2012, 160 (18) : 2523 - 2541
  • [25] Exact and approximate maximum likelihood localization algorithms
    Chan, YT
    Hang, HYC
    Ching, PC
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2006, 55 (01) : 10 - 16
  • [26] Exact algorithms for the maximum planar subgraph problem: New models and experiments
    Chimani M.
    Hedtke I.
    Wiedera T.
    ACM Journal of Experimental Algorithmics, 2019, 24 (01):
  • [27] A graph distance metric combining maximum common subgraph and minimum common supergraph
    Fernández, ML
    Valiente, G
    PATTERN RECOGNITION LETTERS, 2001, 22 (6-7) : 753 - 758
  • [28] Approximating the maximum common subgraph isomorphism problem with a weighted graph
    Chen, Alan Chia-Lung
    Elhajj, Ahmed
    Gao, Shang
    Sarhan, Abdullah
    Afra, Salim
    Kassem, Ahmad
    Alhajj, Reda
    KNOWLEDGE-BASED SYSTEMS, 2015, 85 : 265 - 276
  • [29] Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems
    McCreesh, Ciaran
    Ndiaye, Samba Ndojh
    Prosser, Patrick
    Solnon, Christine
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2016, 2016, 9892 : 350 - 368
  • [30] Maximum Common Subgraph Based Social Network Alignment Method
    Feng S.
    Shen D.-R.
    Nie T.-Z.
    Kou Y.
    Yu G.
    Ruan Jian Xue Bao/Journal of Software, 2019, 30 (07): : 2175 - 2187
12345