Reformulations and complexity of the clique interdiction problem by graph mapping (Q6558672)
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: Reformulations and complexity of the clique interdiction problem by graph mapping |
scientific article; zbMATH DE number 7868436
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reformulations and complexity of the clique interdiction problem by graph mapping |
scientific article; zbMATH DE number 7868436 |
Statements
Reformulations and complexity of the clique interdiction problem by graph mapping (English)
0 references
20 June 2024
0 references
maximum clique
0 references
bilevel programming
0 references
edge clique interdiction
0 references
node clique interdiction
0 references
complexity
0 references
single level reformulation
0 references
facets
0 references
0 references
