Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:51, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs |
scientific article |
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
