Abstract
Abstract We investigate the Maximum Common Edge Subgraph Problem (MCES) defined as follows. Given two graphs G and H with the same number of vertices, find a common subgraph of G and H (not necessary induced) with the maximum number of edges. This problem arises in parallel programming environments, and was first defined by Bokhari in [S. Bokhari, On the mapping problem, IEEE Trans. Comput., C-30(3), 1981]. We present a new integer programming formulation for the MCES problem and carry out a polyhedral investigation of this model. A number of valid inequalities are identified, most of which are facet-defining. We also report on computational experiments.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
