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 programming formulations for MCES and compare the performances of those formulations with earlier formulations from the literature.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
