A wide-ranging computational comparison of high-performance graph colouring algorithms
From MaRDI portal
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Coloring of graphs and hypergraphs (05C15)
Recommendations
Cites work
- scientific article; zbMATH DE number 1728529 (Why is no real title available?)
- scientific article; zbMATH DE number 1728536 (Why is no real title available?)
- scientific article; zbMATH DE number 1728542 (Why is no real title available?)
- scientific article; zbMATH DE number 3646931 (Why is no real title available?)
- scientific article; zbMATH DE number 67483 (Why is no real title available?)
- scientific article; zbMATH DE number 2079895 (Why is no real title available?)
- scientific article; zbMATH DE number 2084735 (Why is no real title available?)
- scientific article; zbMATH DE number 956851 (Why is no real title available?)
- scientific article; zbMATH DE number 956854 (Why is no real title available?)
- 25 pretty graph colouring problems
- A Column Generation Approach for Graph Coloring
- A GRASP for coloring sparse graphs
- A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing
- A graph coloring algorithm for large scheduling problems
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- A memetic algorithm for graph coloring
- A metaheuristic approach for the vertex coloring problem
- A simulated annealing approach to the traveling tournament problem
- A study of permutation operators for minimum span frequency assignment using an order based representation
- A survey of local search methods for graph coloring
- A survey of metaheuristic-based techniques for university timetabling problems
- A variable neighborhood search for graph coloring.
- Almost all k-colorable graphs are easy to color
- An adaptive memory algorithm for the k-coloring problem
- An application of graph coloring to printed circuit testing
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
- An improved ant colony optimisation heuristic for graph colouring
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- Ant colony optimization.
- Ants can colour graphs
- Chromatic Scheduling and the Chromatic Number Problem
- Future paths for integer programming and links to artificial intelligence
- Genetic algorithm for graph coloring: exploration of Galinier and Hao's algorithm
- Genetic and hybrid algorithms for graph coloring
- Graph coloring with adaptive evolutionary algorithms
- Hybrid evolutionary algorithms for graph coloring
- Metaheuristics for high school timetabling
- New methods to color the vertices of a graph
- On edge orienting methods for graph coloring
- On the application of graph colouring techniques in round-robin sports scheduling
- One-factorizations of the complete graph—A survey
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Reducibility among combinatorial problems
- Scheduling fixtures for basketball New Zealand
- Some experiments with simulated annealing for coloring graphs
- Some models of graphs for scheduling sports competitions
- Using an incomplete version of dynamic backtracking for graph colouring
- Using tabu search techniques for graph coloring
- Variable space search for graph coloring
- Worst case analysis of a graph coloring algorithm
Cited in
(7)- Towards objective measures of algorithm performance across instance space
- Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem
- Experimental analysis of algorithms for the dynamic graph coloring problem
- An exact algorithm with learning for the graph coloring problem
- Exploring the role of graph spectra in graph coloring algorithm performance
- Evaluation of serial and parallel shared-memory distance-1 graph coloring algorithms
- A hybrid heuristic for the maximum dispersion problem
This page was built for publication: A wide-ranging computational comparison of high-performance graph colouring algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761113)
