Formulations for the maximum common edge subgraph problem

被引：1
|
作者：
de Gastines, Etienne [1 ]
Knippel, Arnaud [1 ]
机构：
[1] Normandie Univ, INSA Rouen Normandie, LMI UR 3226, F-76000 Rouen, France
来源：
DISCRETE APPLIED MATHEMATICS | 2024年 / 346卷
关键词：
Maximum common subgraph; Graph matching; 0-1; programming;
D O I：
10.1016/j.dam.2023.11.044
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The Maximum Common Edge Subgraph Problem (MCES), given two graphs G and H, asks about finding a maximum common subgraph between those two graphs with a maximal number of edges. We present new integer programming formulations for MCES and compare the performances of those formulations with earlier formulations from the literature.(c) 2023 Elsevier B.V. All rights reserved.
引用
收藏
页码：115 / 130
页数：16
相关论文
共 50 条
  • [41] AN ALGORITHM FOR THE MULTIPLE COMMON SUBGRAPH PROBLEM
    BAYADA, DM
    SIMPSON, RW
    JOHNSON, AP
    LAURENCO, C
    JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES, 1992, 32 (06): : 680 - 685
  • [42] Subgraph extraction and metaheuristics for the maximum clique problem
    Duc-Cuong Dang
    Aziz Moukrim
    Journal of Heuristics, 2012, 18 : 767 - 794
  • [43] On the maximum small-world subgraph problem
    Kim, Jongeun
    Veremyev, Alexander
    Boginski, Vladimir
    Prokopyev, Oleg A.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 280 (03) : 818 - 831
  • [44] Local approximations for maximum partial subgraph problem
    Monnot, J
    Paschos, VT
    Toulouse, S
    OPERATIONS RESEARCH LETTERS, 2004, 32 (03) : 217 - 224
  • [45] Subgraph extraction and metaheuristics for the maximum clique problem
    Dang, Duc-Cuong
    Moukrim, Aziz
    JOURNAL OF HEURISTICS, 2012, 18 (05) : 767 - 794
  • [46] An approximation algorithm for the maximum spectral subgraph problem
    Bazgan, Cristina
    Beaujean, Paul
    Gourdin, Eric
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 44 (03) : 1880 - 1899
  • [47] Tight bounds for the maximum acyclic subgraph problem
    Berger, B
    Shor, PW
    JOURNAL OF ALGORITHMS, 1997, 25 (01) : 1 - 18
  • [48] An approximation algorithm for the maximum spectral subgraph problem
    Cristina Bazgan
    Paul Beaujean
    Éric Gourdin
    Journal of Combinatorial Optimization, 2022, 44 : 1880 - 1899
  • [49] Effective feature construction by maximum common subgraph sampling
    Schietgat, Leander
    Costa, Fabrizio
    Ramon, Jan
    De Raedt, Luc
    MACHINE LEARNING, 2011, 83 (02) : 137 - 161
  • [50] The Labeled Two Edge Connected Subgraph Problem
    Ben Salem, Mariem
    Taktak, Raouia
    2022 8TH INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT'22), 2022, : 1020 - 1025
12345