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 条

[41] Relaxed approximate coloring in exact maximum clique search
San Segundo, Pablo
Tapia, Cristobal
COMPUTERS & OPERATIONS RESEARCH, 2014, 44 : 185 - 192
[42] Exact and Approximate Maximum Inner Product Search with LEMP
Teflioudi, Christina
Gemulla, Rainer
ACM TRANSACTIONS ON DATABASE SYSTEMS, 2017, 42 (01):
[43] On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product
Chen, Lijie
THEORY OF COMPUTING, 2020, 16
[44] On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product
Chen, Lijie
33RD COMPUTATIONAL COMPLEXITY CONFERENCE (CCC 2018), 2018, 102
[45] Finding a Maximum Common Subgraph from Molecular Structural Formulas through the Maximum Clique Approach Combined with the Ising Model
Okamoto, Yasuharu
ACS OMEGA, 2020, 5 (22): : 13064 - 13068
[46] An exact algorithm for the maximum weight K3-free subgraph problem
Fujiwara, Masayasu
Yamaguchi, Kazuaki
Masuda, Sumio
WORLD CONGRESS ON ENGINEERING 2008, VOLS I-II, 2008, : 834 - 837
[47] Recursive-Parallel Algorithm for Solving the Maximum Common Subgraph Problem
V. V. Vasilchikov
Automatic Control and Computer Sciences, 2024, 58 (7) : 827 - 835
[48] Maximum common subgraph: some upper bound and lower bound results
Huang, Xiuzhen
Lai, Jing
Jennings, Steven F.
BMC BIOINFORMATICS, 2006, 7 (Suppl 4)
[49] A GPU based maximum common subgraph algorithm for drug discovery applications
Jayaraj, P. B.
Rahamathulla, K.
Gopakumar, G.
2016 IEEE 30TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW), 2016, : 580 - 588
[50] A Learning Based Branch and Bound for Maximum Common Subgraph Related Problems
Liu, Yanli
Li, Chu-Min
Jiang, Hua
He, Kun
THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 2392 - 2399

← 1 2 3 4 5 →