Formulations for the maximum common edge subgraph problem

DOI10.1016/j.dam.2023.11.044OpenAlexW4389775223MaRDI QIDQ6193953

Etienne de Gastines, Arnaud Knippel

Publication date: 14 February 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2023.11.044

zbMATH Keywords

0-1 programminggraph matchingmaximum common subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Integer programming (90C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• The maximum common edge subgraph problem: A polyhedral investigation
• A branch&cut algorithm for the maximum common edge subgraph problem
• A large database of graphs and its use for benchmarking graph isomorphism algorithms

This page was built for publication: Formulations for the maximum common edge subgraph problem