Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: A Branch&cut Algorithm For The Maximum Common Edge Subgraph Problem
Author: Manic G.
Bahiense L.
de Souza C.
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. © 2009 Elsevier B.V. All rights reserved.
Rights: fechado
Identifier DOI: 10.1016/j.endm.2009.11.009
Date Issue: 2009
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
2-s2.0-70949084126.pdf202.09 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.