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 条

[1] Fast approximate maximum common subgraph computation
Fuchs, Mathias
Riesen, Kaspar
PATTERN RECOGNITION LETTERS, 2025, 190 : 66 - 72
[2] An Approximate Maximum Common Subgraph Algorithm for Large Digital Circuits
Rutgers, Jochem H.
Wolkotte, Pascal T.
Holzenspies, Philip K. F.
Kuper, Jan
Smit, Gerard J. M.
13TH EUROMICRO CONFERENCE ON DIGITAL SYSTEM DESIGN: ARCHITECTURES, METHODS AND TOOLS, 2010, : 699 - 705
[3] A new approach and faster exact methods for the maximum common subgraph problem
Suters, WH
Abu-Khzam, FN
Zhang, Y
Symons, CT
Samatova, NF
Langston, MA
COMPUTING AND COMBINATORICS, PROCEEDINGS, 2005, 3595 : 717 - 727
[4] Between Subgraph Isomorphism and Maximum Common Subgraph
Hoffmann, Ruth
McCreesh, Ciaran
Reilly, Craig
THIRTY-FIRST AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 3907 - 3914
[5] Median graph: A new exact algorithm using a distance based on the maximum common subgraph
Ferrer, M.
Valveny, E.
Serratosa, F.
PATTERN RECOGNITION LETTERS, 2009, 30 (05) : 579 - 588
[6] ON THE APPROXIMABILITY OF THE MAXIMUM COMMON SUBGRAPH PROBLEM
KANN, V
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 577 : 377 - 388
[7] Maximum Common Subgraph Isomorphism Algorithms
Duesbury, Edmund
Holliday, John D.
Willett, Peter
MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2017, 77 (02) : 213 - 232
[8] Fast Similar Subgraph Search with Maximum Common Connected Subgraph Constraints
Hu, Huiqi
Li, Guoliang
Feng, Jianhua
2013 IEEE INTERNATIONAL CONGRESS ON BIG DATA, 2013, : 181 - 188
[9] Exact Algorithm for the Maximum Induced Planar Subgraph Problem
Fomin, Fedor V.
Todinca, Ioan
Villanger, Yngve
ALGORITHMS - ESA 2011, 2011, 6942 : 287 - 298
[10] Mean and maximum common subgraph of two graphs
Bunke, H
Kandel, A
PATTERN RECOGNITION LETTERS, 2000, 21 (02) : 163 - 168

← 1 2 3 4 5 →