A branch&cut algorithm for the maximum common edge subgraph problem

DOI10.1016/j.endm.2009.11.009zbMath1268.05206OpenAlexW2083958948WikidataQ115926588 ScholiaQ115926588MaRDI QIDQ2840513

Laura Bahiense, Gordana Manić, Cid Carvalho De Souza

Publication date: 19 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.11.009

zbMATH Keywords

polyhedral combinatoricsgraph isomorphismmapping problemmaximum common subgraph problembranch \& cut algorithm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Formulations for the maximum common edge subgraph problem

This page was built for publication: A branch&cut algorithm for the maximum common edge subgraph problem