Algorithm Selection for the Graph Coloring Problem
- 26 November 2013
- book chapter
- Published by Springer Nature
- p. 389-403
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Measuring instance difficulty for combinatorial optimization problemsComputers & Operations Research, 2012
- A survey on vertex coloring problemsInternational Transactions in Operational Research, 2009
- Empirical hardness modelsJournal of the ACM, 2009
- A machine learning approach to algorithm selection for $\mathcal{NP}$ -hard optimization problems: a case study on the MPE problemAnnals of Operations Research, 2007
- Register allocation and spilling via graph coloringACM SIGPLAN Notices, 2004
- Polynomial Approximation and Graph-ColoringComputing, 2003
- No free lunch theorems for optimizationIEEE Transactions on Evolutionary Computation, 1997
- New methods to color the vertices of a graphCommunications of the ACM, 1979
- A Set of Measures of Centrality Based on BetweennessSociometry, 1977
- An application of graph coloring to printed circuit testingIEEE Transactions on Circuits and Systems, 1976