Polyhedral study of the maximum common induced subgraph problem

DOI10.1007/s10479-011-1019-8zbMath1251.90375OpenAlexW1996615424WikidataQ115926707 ScholiaQ115926707MaRDI QIDQ1761750

Breno Piva, Cid Carvalho De Souza

Publication date: 15 November 2012

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://ri.ufs.br/handle/riufs/1705

zbMATH Keywords

integer programmingbranch-and-boundbranch-and-cutmaximum cliquepolyhedral combinatoricsmaximum common induced subgraph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Uses Software

• DIMACS

Cites Work

• A fast algorithm for the maximum clique problem
• The structure-mapping engine: Algorithm and examples
• Video indexing and similarity retrieval by largest common subgraph detection using decision trees
• E ₁₁ and M theory
• Backtrack search algorithms and the maximal common subgraph problem
• A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
• RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs
• Computing and Combinatorics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Polyhedral study of the maximum common induced subgraph problem