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 条
  • [31] Effective feature construction by maximum common subgraph sampling
    Leander Schietgat
    Fabrizio Costa
    Jan Ramon
    Luc De Raedt
    Machine Learning, 2011, 83 : 137 - 161
  • [32] Polyhedral study of the maximum common induced subgraph problem
    Piva, Breno
    de Souza, Cid Carvalho
    ANNALS OF OPERATIONS RESEARCH, 2012, 199 (01) : 77 - 102
  • [33] The maximum common edge subgraph problem: A polyhedral investigation
    Bahiense, Laura
    Manic, Gordana
    Piva, Breno
    de Souza, Cid C.
    DISCRETE APPLIED MATHEMATICS, 2012, 160 (18) : 2523 - 2541
  • [34] A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree
    Akutsu, Tatsuya
    Tamura, Takeyuki
    ALGORITHMS, 2013, 6 (01) : 119 - 135
  • [35] The maximum spectral radius of graphs of given size with forbidden subgraph
    Fang, Xiaona
    You, Lihua
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2023, 666 : 114 - 128
  • [36] Exact algorithms for maximum acyclic subgraph on a superclass of cubic graphs
    Fernau, Henning
    Raible, Daniel
    WALCOM: ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2008, 4921 : 144 - +
  • [37] THE MAXIMUM K-COLORABLE SUBGRAPH PROBLEM FOR CHORDAL GRAPHS
    YANNAKAKIS, M
    GAVRIL, F
    INFORMATION PROCESSING LETTERS, 1987, 24 (02) : 133 - 137
  • [38] Maximum h-colourable subgraph problem in balanced graphs
    Dahlhaus, E
    Manuel, PD
    Miller, M
    INFORMATION PROCESSING LETTERS, 1998, 65 (06) : 301 - 303
  • [39] The maximum acyclic subgraph problem and degree-3 graphs
    Newman, A
    APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2001, 2129 : 147 - 158
  • [40] A graph distance metric combining maximum common subgraph and minimum common supergraph
    Fernández, ML
    Valiente, G
    PATTERN RECOGNITION LETTERS, 2001, 22 (6-7) : 753 - 758
12345