Inductive $k$ k -independent graphs and c-colorable subgraphs in scheduling: a review
- 18 December 2018
- journal article
- research article
- Published by Springer Nature in Journal of Scheduling
- Vol. 22 (1) , 3-20
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Russian Foundation for Basic Research (16-31-60007)
- Ministry of Education and Science of the Russian Federation (5-100)
This publication has 44 references indexed in Scilit:
- Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexityEuropean Journal of Combinatorics, 2013
- Elimination graphsACM Transactions on Algorithms, 2012
- On the parameterized complexity of some optimization problems related to multiple-interval graphsTheoretical Computer Science, 2010
- Interval scheduling: A surveyNaval Research Logistics (NRL), 2007
- Tolerance intersection graphs on binary trees with constant tolerance 3Discrete Mathematics, 2000
- Mutual exclusion schedulingTheoretical Computer Science, 1996
- Color-codingJournal of the ACM, 1995
- Complexity results for scheduling tasks with discrete starting timesJournal of Algorithms, 1982
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- On rigid circuit graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961