Improving the extraction and expansion method for large graph coloring
From MaRDI portal
(Redirected from Publication:714028)
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1488073 (Why is no real title available?)
- scientific article; zbMATH DE number 2086445 (Why is no real title available?)
- scientific article; zbMATH DE number 956852 (Why is no real title available?)
- scientific article; zbMATH DE number 956854 (Why is no real title available?)
- scientific article; zbMATH DE number 956867 (Why is no real title available?)
- A graph coloring algorithm for large scheduling problems
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- A graph-based hyper-heuristic for educational timetabling problems
- A metaheuristic approach for the vertex coloring problem
- A search space ``cartography for guiding graph coloring heuristics
- A survey of local search methods for graph coloring
- A survey on vertex coloring problems
- A variable neighborhood search for graph coloring.
- Adaptive tabu search for course timetabling
- An adaptive memory algorithm for the k-coloring problem
- An ant-based algorithm for coloring graphs
- An application of graph coloring to printed circuit testing
- An efficient algorithm for computing the distance between close partitions
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
- Ant local search and its efficient adaptation to graph colouring
- Ants can colour graphs
- Bag rationalisation for a food manufacturer
- Coloring large graphs based on independent set extraction
- Embedding a novel objective function in a two-phased local search for robust vertex coloring
- Genetic algorithm for graph coloring: exploration of Galinier and Hao's algorithm
- Genetic and hybrid algorithms for graph coloring
- Graph coloring by multiagent fusion search
- Handbook of Approximation Algorithms and Metaheuristics
- Hybrid evolutionary algorithms for graph coloring
- Improving heuristics for the frequency assignment problem
- Improving the extraction and expansion method for large graph coloring
- New methods to color the vertices of a graph
- On a graph-theoretical model for cyclic register allocation
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Optimization by ant algorithms: possible roles for an individual ant
- Quantum annealing of the graph coloring problem
- Some experiments with simulated annealing for coloring graphs
- Using tabu search techniques for graph coloring
- Variable space search for 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
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)
