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 条
  • [1] On Maximum Common Subgraph Problems in Series-Parallel Graphs
    Kriege, Nils
    Kurpicz, Florian
    Mutzel, Petra
    COMBINATORIAL ALGORITHMS, IWOCA 2014, 2015, 8986 : 200 - 212
  • [2] 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 - +
  • [3] On maximum common subgraph problems in series-parallel graphs
    Kriege, Nils
    Kurpicz, Florian
    Mutzel, Petra
    EUROPEAN JOURNAL OF COMBINATORICS, 2018, 68 : 79 - 95
  • [4] METRIC FOR COMPARING GRAPHS WITH ORDERED VERTICES BASED ON THE MAXIMUM COMMON SUBGRAPH
    Moskin, N. D.
    PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2021, (52): : 105 - 113
  • [5] Between Subgraph Isomorphism and Maximum Common Subgraph
    Hoffmann, Ruth
    McCreesh, Ciaran
    Reilly, Craig
    THIRTY-FIRST AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 3907 - 3914
  • [6] A comparison of three maximum common subgraph algorithms on a large database of labeled graphs
    Conte, D
    Guidobaldi, C
    Sansone, C
    GRAPH BASED REPRESENTATIONS IN PATTERN RECOGNITION, PROCEEDINGS, 2003, 2726 : 130 - 141
  • [7] Heuristics for similarity searching of chemical graphs using a maximum common edge subgraph algorithm
    Raymond, JW
    Gardiner, EJ
    Willett, P
    JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES, 2002, 42 (02): : 305 - 316
  • [8] ON THE APPROXIMABILITY OF THE MAXIMUM COMMON SUBGRAPH PROBLEM
    KANN, V
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 577 : 377 - 388
  • [9] 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
  • [10] Estimations of subgraph positions in molecular graphs and their common subgraph peculiarities
    L. I. Makarov
    Journal of Structural Chemistry, 2005, 46 : 738 - 743
12345