A comparison of ILP formulations for solving the MCES problem

Vol 56, 2024 - 310083
Extended Abstracts (EA)
Favorite this paper
How to cite this paper?
Abstract

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 linear programming formulations for MCES and compare the performances of those formulations with earlier formulations from the literature.

Share your ideas or questions with the authors!

Did you know that the greatest stimulus in scientific and cultural development is curiosity? Leave your questions or suggestions to the author!

Sign in to interact

Have a question or suggestion? Share your feedback with the authors!

Programme
09:30 to 10:42 on 11/07/2024
Pedro Lazar 2
Institutions
  • 1 INSA Rouen Normandie
Track
  • 14. OC – Combinatorial Optimization
Keywords
Maximum common subgraph
graph matching
Integer Linear Programming
Mathematical Programming
Combinatorial Optimization