The maximum common edge subgraph problem: A polyhedral investigation (Q1759826)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The maximum common edge subgraph problem: A polyhedral investigation |
scientific article; zbMATH DE number 6109901
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The maximum common edge subgraph problem: A polyhedral investigation |
scientific article; zbMATH DE number 6109901 |
Statements
The maximum common edge subgraph problem: A polyhedral investigation (English)
0 references
22 November 2012
0 references
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.
0 references
maximum common subgraph problem
0 references
number of edges
0 references
graph isomorphism
0 references
polyhedral combinatorics
0 references
branch-and-cut algorithms
0 references
computational experiments
0 references
computational results
0 references
0.8287047147750854
0 references
0.7872140407562256
0 references
0.7580190300941467
0 references
0.7494935393333435
0 references
