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 the normal view instead:
scientific article; zbMATH DE number 7000177
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9961000680923462
0 references
0.8432936072349548
0 references
0.7676739692687988
0 references
0.7501443028450012
0 references
0.7475089430809021
0 references
