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 条
  • [21] From exact to approximate maximum common subgraph
    Marini, S
    Spagnuolo, M
    Falcidieno, B
    GRAPH-BASED REPRESENTATIONS IN PATTERN RECOGNITION, PROCEEDINGS, 2005, 3434 : 263 - 272
  • [22] A Partitioning Algorithm for Maximum Common Subgraph Problems
    McCreesh, Ciaran
    Prosser, Patrick
    Trimble, James
    PROCEEDINGS OF THE TWENTY-SIXTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 712 - 719
  • [23] An Improved Maximum Common Induced Subgraph Solver
    Depolli, Matjaz
    Szabo, Sandor
    Zavalnij, Bogdan
    MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2020, 84 (01) : 7 - 28
  • [24] A genetic approach to the maximum common subgraph problem
    Valenti, Cesare
    COMPUTER SYSTEMS AND TECHNOLOGIES, 2019, : 98 - 104
  • [25] Vertex Decompositions of Sparse Graphs into an Edgeless Subgraph and a Subgraph of Maximum Degree at Most k
    Borodin, O. V.
    Ivanova, A. O.
    Montassier, M.
    Ochem, P.
    Raspaud, A.
    JOURNAL OF GRAPH THEORY, 2010, 65 (02) : 83 - 93
  • [26] The Multi-Maximum and Quasi-Maximum Common Subgraph Problem
    Cardone, Lorenzo
    Quer, Stefano
    COMPUTATION, 2023, 11 (04)
  • [27] Effective feature construction by maximum common subgraph sampling
    Schietgat, Leander
    Costa, Fabrizio
    Ramon, Jan
    De Raedt, Luc
    MACHINE LEARNING, 2011, 83 (02) : 137 - 161
  • [28] Maximum common induced subgraph parameterized by vertex cover
    Abu-Khzam, Faisal N.
    INFORMATION PROCESSING LETTERS, 2014, 114 (03) : 99 - 103
  • [29] A Comparison of Decomposition Methods for the Maximum Common Subgraph Problem
    Minot, Mael
    Ndiaye, Samba Ndojh
    Solnon, Christine
    2015 IEEE 27TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2015), 2015, : 461 - 468
  • [30] Polyhedral study of the maximum common induced subgraph problem
    Breno Piva
    Cid Carvalho de Souza
    Annals of Operations Research, 2012, 199 : 77 - 102
12345