Improving the extraction and expansion method for large graph coloring
From MaRDI portal
Publication:714028
DOI10.1016/j.dam.2012.06.007zbMath1251.05059OpenAlexW2064850189MaRDI QIDQ714028
Publication date: 19 October 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.06.007
graph coloringgraph \(k\)-coloringindependent set extractionmemetic coloringprogressive optimization
Related Items
Computing lower bounds for minimum sum coloring and optimum cost chromatic partition, Improving the extraction and expansion method for large graph coloring, AN EXTRACTION AND EXPANSION APPROACH FOR GRAPH COLORING
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- An efficient algorithm for computing the distance between close partitions
- 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.
- Genetic algorithm for graph coloring: exploration of Galinier and Hao's algorithm
- Optimization by ant algorithms: possible roles for an individual ant
- 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 ant-based algorithm for coloring graphs
- An adaptive memory algorithm for the \(k\)-coloring problem
- Embedding a novel objective function in a two-phased local search for robust vertex coloring
- A survey of local search methods for graph coloring
- A Metaheuristic Approach for the Vertex Coloring Problem
- A survey on vertex coloring problems
- Handbook of Approximation Algorithms and Metaheuristics
- Ant Local Search and its efficient adaptation to graph colouring
- 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
- Ants can colour graphs
- Bag rationalisation for a food manufacturer
