Exploring the role of graph spectra in graph coloring algorithm performance
DOI10.1016/J.DAM.2013.11.005zbMATH Open1298.05208DBLPjournals/dam/Smith-MilesB14OpenAlexW2083430285WikidataQ62033349 ScholiaQ62033349MaRDI QIDQ403572FDOQ403572
Davaatseren Baatar, Kate A. Smith-Miles
Publication date: 29 August 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.11.005
Recommendations
- A wide-ranging computational comparison of high-performance graph colouring algorithms
- Towards objective measures of algorithm performance across instance space
- A range-compaction heuristic for graph coloring
- scientific article; zbMATH DE number 1703855
- Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15)
Cites Work
- House of Graphs: a database of interesting graphs
- MyPYTHIA: a recommendation portal for scientific software and services
- PYTHIA-II
- GAUSS: an online algorithm selection system for numerical quadrature
- Principal component analysis.
- 10.1162/153244303322753616
- A survey of local search methods for graph coloring
- Title not available (Why is that?)
- Frozen development in graph coloring
- Facet defining inequalities among graph invariants: The system graphedron
- A fast algorithm for the maximum clique problem
- Title not available (Why is that?)
- A graph-based hyper-heuristic for educational timetabling problems
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- New methods to color the vertices of a graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results
- The TSP phase transition
- Measuring instance difficulty for combinatorial optimization problems
- Hybrid evolutionary algorithms for graph coloring
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- Title not available (Why is that?)
- A Column Generation Approach for Graph Coloring
- The energy of a graph
- Using tabu search techniques for graph coloring
- An introduction to timetabling
- An algorithm for finding a maximum clique in a graph
- The Effects of Coefficient Correlation Structure in Two-Dimensional Knapsack Problems on Solution Procedure Performance
- Discovering the suitability of optimisation algorithms by learning from evolved instances
- Needed: An Empirical Science of Algorithms
- 10.1162/153244303322753634
- What makes an optimization problem hard?.
- 10.1162/153244303322753742
- Phase Transitions in Combinatorial Optimization Problems
- Ranking learning algorithms: Using IBL and meta-learning on accuracy and time results
- Genetic and hybrid algorithms for graph coloring
- On the classification of NP-complete problems in terms of their correlation coefficient
- A simple branching scheme for vertex coloring problems
Cited In (3)
Uses Software
This page was built for publication: Exploring the role of graph spectra in graph coloring algorithm performance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403572)
