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 条
  • [1] 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
  • [2] ON THE APPROXIMABILITY OF THE MAXIMUM COMMON SUBGRAPH PROBLEM
    KANN, V
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 577 : 377 - 388
  • [3] A polyhedral study of the maximum edge subgraph problem
    Bonomo, Flavia
    Marenco, Javier
    Saban, Daniela
    Stier-Moses, Nicolas E.
    DISCRETE APPLIED MATHEMATICS, 2012, 160 (18) : 2573 - 2590
  • [4] A genetic approach to the maximum common subgraph problem
    Valenti, Cesare
    COMPUTER SYSTEMS AND TECHNOLOGIES, 2019, : 98 - 104
  • [5] The maximum induced bipartite subgraph problem with edge weights
    Cornaz, Denis
    Mahjoub, A. Ridha
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2007, 21 (03) : 662 - 675
  • [6] 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
  • [7] Polyhedral study of the maximum common induced subgraph problem
    Breno Piva
    Cid Carvalho de Souza
    Annals of Operations Research, 2012, 199 : 77 - 102
  • [8] Polyhedral study of the maximum common induced subgraph problem
    Piva, Breno
    de Souza, Cid Carvalho
    ANNALS OF OPERATIONS RESEARCH, 2012, 199 (01) : 77 - 102
  • [9] The Multi-Maximum and Quasi-Maximum Common Subgraph Problem
    Cardone, Lorenzo
    Quer, Stefano
    COMPUTATION, 2023, 11 (04)
  • [10] Approximating the maximum 3-edge-colorable subgraph problem
    Rizzi, Romeo
    DISCRETE MATHEMATICS, 2009, 309 (12) : 4166 - 4170
12345