AN EXTRACTION AND EXPANSION APPROACH FOR GRAPH COLORING
From MaRDI portal
Publication:2868189
DOI10.1142/S0217595913500188zbMath1278.90420OpenAlexW1966879981MaRDI QIDQ2868189
Publication date: 27 December 2013
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595913500188
Programming involving graphs or networks (90C35) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Quantum annealing of the graph coloring problem
- Using tabu search techniques for graph coloring
- Some experiments with simulated annealing for coloring graphs
- Improving the extraction and expansion method for large graph coloring
- Variable space search for graph coloring
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
- Graph coloring by multiagent fusion search
- A search space ``cartography for guiding graph coloring heuristics
- Improving heuristics for the frequency assignment problem
- On a graph-theoretical model for cyclic register allocation
- A variable neighborhood search for graph coloring.
- Coloring large graphs based on independent set extraction
- Genetic and hybrid algorithms for graph coloring
- Hybrid evolutionary algorithms for graph coloring
- Adaptive tabu search for course timetabling
- A graph-based hyper-heuristic for educational timetabling problems
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- An adaptive memory algorithm for the \(k\)-coloring problem
- A survey of local search methods for graph coloring
- A Metaheuristic Approach for the Vertex Coloring Problem
- AUTOMATED LECTURE TIMETABLING USING A MEMETIC ALGORITHM
- A graph coloring algorithm for large scheduling problems
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- An application of graph coloring to printed circuit testing
- New methods to color the vertices of a graph