Improving the extraction and expansion method for large graph coloring
From MaRDI portal
Publication:714028
DOI10.1016/J.DAM.2012.06.007zbMATH Open1251.05059OpenAlexW2064850189MaRDI QIDQ714028FDOQ714028
Authors: Jin-Kao Hao, Qinghua Wu 
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
Recommendations
graph coloringgraph \(k\)-coloringindependent set extractionmemetic coloringprogressive optimization
Cites Work
- Coloring large graphs based on independent set extraction
- Ants can colour graphs
- Title not available (Why is that?)
- A survey of local search methods for graph coloring
- A search space ``cartography for guiding graph coloring heuristics
- Adaptive tabu search for course timetabling
- A graph-based hyper-heuristic for educational timetabling problems
- A survey on vertex coloring problems
- A graph coloring algorithm for large scheduling problems
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- New methods to color the vertices of a graph
- Hybrid evolutionary algorithms for graph coloring
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- Handbook of Approximation Algorithms and Metaheuristics
- Improving heuristics for the frequency assignment problem
- Using tabu search techniques for graph coloring
- Variable space search for graph coloring
- On a graph-theoretical model for cyclic register allocation
- An adaptive memory algorithm for the \(k\)-coloring problem
- A metaheuristic approach for the vertex coloring problem
- Quantum annealing of the graph coloring problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- An efficient algorithm for computing the distance between close partitions
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
- Title not available (Why is that?)
- A variable neighborhood search for graph coloring.
- Genetic and hybrid algorithms for graph coloring
- Ant local search and its efficient adaptation to graph colouring
- Bag rationalisation for a food manufacturer
- Title not available (Why is that?)
- Some experiments with simulated annealing for coloring graphs
- Graph coloring by multiagent fusion search
- Genetic algorithm for graph coloring: exploration of Galinier and Hao's algorithm
- An application of graph coloring to printed circuit testing
- Optimization by ant algorithms: possible roles for an individual ant
- An ant-based algorithm for coloring graphs
- Embedding a novel objective function in a two-phased local search for robust vertex coloring
- Title not available (Why is that?)
- Improving the extraction and expansion method for large graph coloring
Cited In (5)
- Computing lower bounds for minimum sum coloring and optimum cost chromatic partition
- SAT-boosted tabu search for coloring massive graphs
- An extraction and expansion approach for graph coloring
- Improving the extraction and expansion method for large graph coloring
- Coloring large graphs based on independent set extraction
Uses Software
This page was built for publication: Improving the extraction and expansion method for large graph coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714028)
