Mean and maximum common subgraph of two graphs

被引：29

作者：

Bunke, H

Kandel, A

机构：

[1] Univ Bern, Inst Informat & Angew Math, CH-3012 Bern, Switzerland

[2] Univ S Florida, Dept Comp Sci & Engn, Tampa, FL 33620 USA

来源：

PATTERN RECOGNITION LETTERS | 2000年 / 21卷 / 02期

关键词：

edit distance; graph matching; maximum common subgraph; median graph; clustering;

D O I：

10.1016/S0167-8655(99)00143-9

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

A mean of a pair of graphs, g(1) and g(2), is formally defined as a graph that minimizes the sum of edit distances to g(1) and g(2). The edit distance of two graphs g and g' is the minimum cost taken over all sequences of edit operations that transform g into g'. It will be shown that under a particular set of cost functions for any two graphs, g and g', a maximum common subgraph is a mean. Moreover, any subgraph of g or g' that contains a maximum common subgraph is a mean as well. (C) 2000 Elsevier Science B.V. All rights reserved.

引用

页码：163 / 168

页数：6

共 50 条

[41] 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
[42] 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
[43] Metrics for attributed graphs based on the maximal similarity common subgraph
Hidovic, D
Pelillo, M
INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 2004, 18 (03) : 299 - 313
[44] 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
[45] 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
[46] 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
[47] 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 - +
[48] On a relation between graph edit distance and maximum common subgraph
Bunke, H
PATTERN RECOGNITION LETTERS, 1997, 18 (08) : 689 - 694
[49] Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs
Abu-Affash, A. Karim
Carmi, Paz
Maheshwari, Anil
Morin, Pat
Smid, Michiel
Smorodinsky, Shakhar
DISCRETE & COMPUTATIONAL GEOMETRY, 2021, 66 (04) : 1401 - 1414
[50] Maximum Subgraph Problem and Minimum Linear Arrangement of Generalized Sierpinski Graphs
Rajan R.S.
Greeni A.B.
Joshwa P.L.
Journal of Graph Algorithms and Applications, 2023, 27 (09) : 767 - 782

← 1 2 3 4 5 →