The maximum happy induced subgraph problem: bounds and algorithms (Q2026981)
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: The maximum happy induced subgraph problem: bounds and algorithms |
scientific article; zbMATH DE number 7350518
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The maximum happy induced subgraph problem: bounds and algorithms |
scientific article; zbMATH DE number 7350518 |
Statements
The maximum happy induced subgraph problem: bounds and algorithms (English)
0 references
21 May 2021
0 references
graph colouring
0 references
combinatorial optimisation
0 references
vertex cut sets
0 references
Tabu search
0 references
0 references
0.9012031
0 references
0.8983003
0 references
0.8983002
0 references
0.89819646
0 references
0.8954003
0 references
0 references
0.8901317
0 references
0.8901044
0 references
0.8861567
0 references
