Author:
Furini Fabio,Malaguti Enrico
Subject
Applied Mathematics,Computational Theory and Mathematics,Theoretical Computer Science
Reference18 articles.
1. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979
2. The vertex coloring problem and its generalizations;Malaguti;4OR,2009
3. A survey on vertex coloring problems;Malaguti;International Transactions in Operational Research,2010
4. Time slot scheduling of compatible jobs;De Werra;Journal of Scheduling,2007
5. Weighted coloring: further complexity and approximability results;Escoffier;Information Processing Letters,2006
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献