Polyhedral study of the maximum common induced subgraph problem (Q1761750): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q115926707, #quickstatements; #temporary_batch_1710858552373 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q115926707 / rank | |||
Normal rank | |||
Revision as of 16:39, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polyhedral study of the maximum common induced subgraph problem |
scientific article |
Statements
Polyhedral study of the maximum common induced subgraph problem (English)
0 references
15 November 2012
0 references
maximum common induced subgraph
0 references
polyhedral combinatorics
0 references
integer programming
0 references
branch-and-bound
0 references
branch-and-cut
0 references
maximum clique
0 references
