Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review (Q2327955)
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: Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review |
scientific article |
Statements
Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review (English)
0 references
8 October 2019
0 references
independent set
0 references
job interval selection
0 references
interval graphs
0 references
chordal graphs
0 references
inductive \(k\)-independent graphs
0 references
NP-hard problems
0 references
parameterized complexity
0 references
0 references
0 references
0 references
