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 条
  • [31] Parameterized Complexity of MAXIMUM EDGE COLORABLE SUBGRAPH
    Agrawal, Akanksha
    Kundu, Madhumita
    Sahu, Abhishek
    Saurabh, Saket
    Tale, Prafullkumar
    COMPUTING AND COMBINATORICS (COCOON 2020), 2020, 12273 : 615 - 626
  • [32] Fast Similar Subgraph Search with Maximum Common Connected Subgraph Constraints
    Hu, Huiqi
    Li, Guoliang
    Feng, Jianhua
    2013 IEEE INTERNATIONAL CONGRESS ON BIG DATA, 2013, : 181 - 188
  • [33] On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree
    Akutsu, Tatsuya
    Tamura, Takeyuki
    ALGORITHMS AND COMPUTATION, ISAAC 2012, 2012, 7676 : 146 - 155
  • [34] Mean and maximum common subgraph of two graphs
    Bunke, H
    Kandel, A
    PATTERN RECOGNITION LETTERS, 2000, 21 (02) : 163 - 168
  • [35] Fast approximate maximum common subgraph computation
    Fuchs, Mathias
    Riesen, Kaspar
    PATTERN RECOGNITION LETTERS, 2025, 190 : 66 - 72
  • [36] From exact to approximate maximum common subgraph
    Marini, S
    Spagnuolo, M
    Falcidieno, B
    GRAPH-BASED REPRESENTATIONS IN PATTERN RECOGNITION, PROCEEDINGS, 2005, 3434 : 263 - 272
  • [37] 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
  • [38] 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
  • [39] The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability
    Mkrtchyan V.
    Journal of Graph Algorithms and Applications, 2024, 28 (01) : 129 - 147
  • [40] Algorithm for the multiple common subgraph problem
    Bayada, Denis M.
    Simpson, Richard W.
    Johnson, A. Peter
    Laurenco, Claude
    Journal of Chemical Information and Computer Sciences, 1992, 32 (06):
12345