A branch&cut algorithm for the maximum common edge subgraph problem (Q2840513): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q115926588, #quickstatements; #temporary_batch_1712688784189 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q115926588 / rank | |||
Normal rank | |||
Revision as of 20:16, 9 April 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
