Exploring the role of graph spectra in graph coloring algorithm performance
From MaRDI portal
(Redirected from Publication:403572)
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
Cites work
- scientific article; zbMATH DE number 67483 (Why is no real title available?)
- scientific article; zbMATH DE number 1232919 (Why is no real title available?)
- scientific article; zbMATH DE number 1302184 (Why is no real title available?)
- scientific article; zbMATH DE number 867649 (Why is no real title available?)
- 10.1162/153244303322753616
- 10.1162/153244303322753634
- 10.1162/153244303322753742
- A Column Generation Approach for Graph Coloring
- A fast algorithm for the maximum clique problem
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- A graph-based hyper-heuristic for educational timetabling problems
- A simple branching scheme for vertex coloring problems
- A survey of local search methods for graph coloring
- An algorithm for finding a maximum clique in a graph
- An introduction to timetabling
- Discovering the suitability of optimisation algorithms by learning from evolved instances
- Facet defining inequalities among graph invariants: The system graphedron
- Frozen development in graph coloring
- GAUSS: an online algorithm selection system for numerical quadrature
- Genetic and hybrid algorithms for graph coloring
- House of Graphs: a database of interesting graphs
- Hybrid evolutionary algorithms for graph coloring
- Measuring instance difficulty for combinatorial optimization problems
- MyPYTHIA: a recommendation portal for scientific software and services
- Needed: An Empirical Science of Algorithms
- New methods to color the vertices of a graph
- On the classification of NP-complete problems in terms of their correlation coefficient
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- PYTHIA-II
- Phase Transitions in Combinatorial Optimization Problems
- Principal component analysis.
- Ranking learning algorithms: Using IBL and meta-learning on accuracy and time results
- SATzilla: portfolio-based algorithm selection for SAT
- Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results
- The TSP phase transition
- The effects of coefficient correlation structure in two-dimensional knapsack problems on solution procedure performance
- The energy of a graph
- Using tabu search techniques for graph coloring
- What makes an optimization problem hard?.
Cited in
(5)- Towards objective measures of algorithm performance across instance space
- Experimental analysis of algorithms for the dynamic graph coloring problem
- Generating new test instances by evolving in instance space
- Determining chromatic index of cubic graph with the use of explainable classifiers: a comparative study
- Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis
Describes a project that uses
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)
