A branch \& cut algorithm for the maximum common edge subgraph problem (Q2840513)
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: A branch \& cut algorithm for the maximum common edge subgraph problem |
scientific article; zbMATH DE number 6189789
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch \& cut algorithm for the maximum common edge subgraph problem |
scientific article; zbMATH DE number 6189789 |
Statements
19 July 2013
0 references
maximum common subgraph problem
0 references
mapping problem
0 references
graph isomorphism
0 references
polyhedral combinatorics
0 references
branch \& cut algorithm
0 references
0.9337008
0 references
0.92534125
0 references
0.90870297
0 references
0 references
0.9048878
0 references
0.89799654
0 references
0.89489156
0 references
0.8945954
0 references
0.89393824
0 references
A branch \& cut algorithm for the maximum common edge subgraph problem (English)
0 references
