The maximum common edge subgraph problem: A polyhedral investigation

DOI10.1016/j.dam.2012.01.026zbMath1262.05083OpenAlexW2014436490WikidataQ115926610 ScholiaQ115926610MaRDI QIDQ1759826

Breno Piva, Gordana Manić, Laura Bahiense, Cid Carvalho De Souza

Publication date: 22 November 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.01.026

zbMATH Keywords

computational experimentscomputational resultspolyhedral combinatoricsgraph isomorphismnumber of edgesbranch-and-cut algorithmsmaximum common subgraph problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Integer programming (90C10) Combinatorial optimization (90C27) Boolean programming (90C09) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Automatic Inference of Graph Transformation Rules Using the Cyclic Nature of Chemical Reactions ⋮ Spectral classes of regular, random, and empirical graphs ⋮ Formulations for the maximum common edge subgraph problem ⋮ Graph comparison via nonlinear quantum search

Cites Work

• Genetic algorithm based heuristics for the mapping problem
• Conflict graphs in solving integer programming problems
• Multiprocessor scheduling under precedence constraints: polyhedral results
• RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs
• A branch-and-cut algorithm for the maximum cardinality stable set problem
• Unnamed Item

This page was built for publication: The maximum common edge subgraph problem: A polyhedral investigation