The maximum common edge subgraph problem: A polyhedral investigation
type: Item
instance of: scholarly article
title: The maximum common edge subgraph problem: A polyhedral investigation
zbMATH Open document ID: 1262.05083
author: Laura Bahiense
author: Gordana Manić
author: Breno Piva
author: Cid Carvalho de Souza
published in: Discrete Applied Mathematics
publication date: 2012-11-22T00:00:00Z
review text: The number of vertices of the graphs used during the experiments was less than 40, the estimated power of the computer used was 243 MFlops. The results of these exepriments are compared with those obtained by a Ultra Sparc 1 workstation with an estimated power of 205 MFlops.
reviewed by: Vitali Oscarovich Groppen
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 6109901
zbMATH Keywords: maximum common subgraph problem
zbMATH Keywords: number of edges
zbMATH Keywords: graph isomorphism
zbMATH Keywords: polyhedral combinatorics
zbMATH Keywords: branch-and-cut algorithms
zbMATH Keywords: computational experiments
zbMATH Keywords: computational results
MaRDI profile type: Publication
full work available at URL: j.dam.2012.01.026
OpenAlex ID: W2014436490
Wikidata QID: Q115926610
cites work: Conflict graphs in solving integer programming problems
cites work: Multiprocessor scheduling under precedence constraints: polyhedral results
cites work: Genetic algorithm based heuristics for the mapping problem
cites work: Q4947316
cites work: RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs
cites work: A branch-and-cut algorithm for the maximum cardinality stable set problem
DOI: 10.1016/J.DAM.2012.01.026
description: scientific article; zbMATH DE number 6109901