Inductive k -independent graphs and c-colorable subgraphs in scheduling › Research Explorer

Novosibirsk State University's Research Portal

Inductive k -independent graphs and c-colorable subgraphs in scheduling: a review

Research output: Contribution to journal › Article › peer-review

DOI

https://doi.org/10.1007/s10951-018-0595-8
Final published version

Matthias Bentert
René van Bevern
Rolf Niedermeier

Original language	English
Pages (from-to)	3-20
Number of pages	18
Journal	Journal of Scheduling
Volume	22
Issue number	1
DOIs	https://doi.org/10.1007/s10951-018-0595-8
Publication status	Published - 15 Feb 2019

OECD FOS+WOS

5.02.PE OPERATIONS RESEARCH & MANAGEMENT SCIENCE
2.11.IK ENGINEERING, MANUFACTURING
2.11.IF ENGINEERING, MULTIDISCIPLINARY

Research areas

Chordal graphs, Independent set, Inductive k-independent graphs, Interval graphs, Job interval selection, NP-hard problems, Parameterized complexity, PARAMETERIZED COMPLEXITY, INTERVAL-GRAPHS, NUMBER, RECOGNITION, MULTIVARIATE ALGORITHMICS, JOBS

ID: 18626466