Polyhedral study of the maximum common induced subgraph problem

Breno Piva () and Cid Souza ()

Annals of Operations Research, 2012, vol. 199, issue 1, 77-102

Abstract: In this paper we present an exact algorithm for the Maximum Common Induced Subgraph Problem ( MCIS) by addressing it directly, using Integer Programming ( IP) and polyhedral combinatorics. We study the MCIS polytope and introduce strong valid inequalities, some of which we prove to define facets. Besides, we show an equivalence between our IP model for MCIS and a well-known formulation for the Maximum Clique problem. We report on computational results of branch-and-bound ( B&B) and branch-and-cut ( B&C) algorithms we implemented and compare them to those yielded by an existing combinatorial algorithm. Copyright Springer Science+Business Media, LLC 2012

Keywords: Maximum common induced subgraph; Polyhedral combinatorics; Integer programming; Branch-and-bound; Branch-and-cut; Maximum clique (search for similar items in EconPapers)
Date: 2012
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-011-1019-8 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:199:y:2012:i:1:p:77-102:10.1007/s10479-011-1019-8

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-011-1019-8

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().