Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775)
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: Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs |
scientific article; zbMATH DE number 7000177
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs |
scientific article; zbMATH DE number 7000177 |
Statements
Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (English)
0 references
11 January 2019
0 references
maximum induced subgraphs
0 references
perfect graphs
0 references
co-chordal graphs
0 references
randomized FPT algorithms
0 references
polynomial kernel lower bounds
0 references
0 references
0 references
0 references
0 references
0 references
0 references
