A branch&cut algorithm for the maximum common edge subgraph problem (Q2840513)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch&cut algorithm for the maximum common edge subgraph problem |
scientific article |
Statements
A branch&cut algorithm for the maximum common edge subgraph problem (English)
0 references
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
