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 条

[31] GLSearch: Maximum Common Subgraph Detection via Learning to Search
Bai, Yunsheng
Xu, Derek
Sun, Yizhou
Wang, Wei
INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 139, 2021, 139
[32] SmallWorld: Efficient maximum common subgraph searching of large databases
Sayle, Roger A.
Batista, Jose C.
Grant, Andrew
ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 2012, 244
[33] Maximum common subgraph: Upper bound and lower bound results
Huang, Xiuzhen
Lai, Jing
FIRST INTERNATIONAL MULTI-SYMPOSIUMS ON COMPUTER AND COMPUTATIONAL SCIENCES (IMSCCS 2006), PROCEEDINGS, VOL 1, 2006, : 40 - +
[34] On a relation between graph edit distance and maximum common subgraph
Bunke, H
PATTERN RECOGNITION LETTERS, 1997, 18 (08) : 689 - 694
[35] On Maximum Common Subgraph Problems in Series-Parallel Graphs
Kriege, Nils
Kurpicz, Florian
Mutzel, Petra
COMBINATORIAL ALGORITHMS, IWOCA 2014, 2015, 8986 : 200 - 212
[36] Maximum common subgraph isomorphism algorithms for the matching of chemical structures
John W. Raymond
Peter Willett
Journal of Computer-Aided Molecular Design, 2002, 16 : 521 - 533
[37] On the relation between the median and the maximum common subgraph of a set of graphs
Ferrer, Miquel
Serratosa, Francesc
Valveny, Ernest
GRAPH-BASED REPRESENTATIONS IN PATTERN RECOGNITION, PROCEEDINGS, 2007, 4538 : 351 - +
[38] On maximum common subgraph problems in series-parallel graphs
Kriege, Nils
Kurpicz, Florian
Mutzel, Petra
EUROPEAN JOURNAL OF COMBINATORICS, 2018, 68 : 79 - 95
[39] A Grid Map Fusion Algorithm Based on Maximum Common Subgraph
Sun, Yong
Sun, Rongchuan
Yu, Shumei
Peng, Yan
2018 13TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION (WCICA), 2018, : 58 - 63
[40] Maximum common subgraph isomorphism algorithms for the matching of chemical structures
Raymond, JW
Willett, P
JOURNAL OF COMPUTER-AIDED MOLECULAR DESIGN, 2002, 16 (07) : 521 - 533

← 1 2 3 4 5 →