Improving the extraction and expansion method for large graph coloring

Authors:
Jin-Kao Hao;Qinghua Wu
Affiliations:
-;-
Venue:
Discrete Applied Mathematics
Year:
2012

Citing 19
Cited 0

Using tabu search techniques for graph coloring

Computing
Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
On a graph-theoretical model for cyclic register allocation

Discrete Applied Mathematics
New methods to color the vertices of a graph

Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A New Genetic Local Search Algorithm for Graph Coloring

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Scatter Search for Graph Coloring

Selected Papers from the 5th European Conference on Artificial Evolution
A survey of local search methods for graph coloring

Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
A graph coloring heuristic using partial solutions and a reactive tabu scheme

Computers and Operations Research
An adaptive memory algorithm for the k-coloring problem

Discrete Applied Mathematics
An ant-based algorithm for coloring graphs

Discrete Applied Mathematics
Variable space search for graph coloring

Discrete Applied Mathematics
A Metaheuristic Approach for the Vertex Coloring Problem

INFORMS Journal on Computing
A search space "cartography" for guiding graph coloring heuristics

Computers and Operations Research
An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring

Computers and Operations Research
An efficient algorithm for computing the distance between close partitions

Discrete Applied Mathematics
Coloring large graphs based on independent set extraction

Computers and Operations Research
Graph coloring with a distributed hybrid quantum annealing algorithm

KES-AMSTA'11 Proceedings of the 5th KES international conference on Agent and multi-agent systems: technologies and applications
Note: Quantum annealing of the graph coloring problem

Discrete Optimization

Quantified Score

Hi-index	0.04

Visualization

Abstract

Graph coloring is one of the most studied combinatorial optimization problems. This paper presents an improved extraction and expansion method (IE^2COL), initially introduced in Wu and Hao (2012) [44]. IE^2COL employs a forward independent set extraction strategy to reduce the initial graph G. From the reduced graph, IE^2COL triggers a backward coloring process which uses extracted independent sets as new color classes for intermediate subgraph coloring. The proposed method is assessed on 20 large benchmark graphs with 900 to 4000 vertices. Computational results show that it provides new upper bounds for 6 graphs and consistently matches the current best-known results for 12 other graphs.