A branch&cut algorithm for the maximum common edge subgraph problem (Q2840513): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.endm.2009.11.009 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2083958948 / rank | |||
Normal rank | |||
Revision as of 02:20, 20 March 2024
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
