Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00453-018-0431-8 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00453-018-0431-8 / rank | |||
Normal rank | |||
Latest revision as of 08:31, 11 December 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
0 references
0 references
0 references
0 references
0 references
0 references
