Inductive $$k$$ k -independent graphs and c-colorable subgraphs in scheduling: a review
Crossref DOI link: https://doi.org/10.1007/s10951-018-0595-8
Published Online: 2018-12-18
Published Print: 2019-02
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Bentert, Matthias
van Bevern, René http://orcid.org/0000-0002-4805-218X
Niedermeier, Rolf
Funding for this research was provided by:
Russian Foundation for Basic Research (16-31-60007)
Ministry of Education and Science of the Russian Federation (5-100)
Text and Data Mining valid from 2018-12-18
Article History
First Online: 18 December 2018