Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review (Q2327955): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10951-018-0595-8 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10951-018-0595-8 / rank | |||
Normal rank | |||
Latest revision as of 00:46, 18 December 2024
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
