A Tree Based Novel Approach for Graph Coloring Problem Using Maximal Independent Set

Graph coloring problem is a famous NP-complete problem and there exist several methods which have been projected to resolve this issue. For a graph colouring algorithm to be efficient, it ought to paint the input graph by minimum colours and must also find the solution in the minimum possible time. Here, we have proposed a different method to solve the graph coloring problem using maximal independent set. In our method, we used the concept of maximal independent sets using trees. In the first part, it converts a massive graph into a sequence of step by step smaller graphs by eliminating big independent sets from the initial graph. The second part starts by assigning a proper colour to each maximal independent set within the sequence. The proposed method is estimated on the DIMACS standards and presented reasonable outcomes concerning to other latest methods.

[1]  Paolo Toth,et al.  An exact approach for the Vertex Coloring Problem , 2011, Discret. Optim..

[2]  Sanja Petrovic,et al.  A graph-based hyper-heuristic for educational timetabling problems , 2007, Eur. J. Oper. Res..

[3]  Stephen B. Seidman,et al.  Network structure and minimum degree , 1983 .

[4]  Alain Hertz,et al.  A survey of local search methods for graph coloring , 2004, Comput. Oper. Res..

[5]  Paolo Toth,et al.  A Metaheuristic Approach for the Vertex Coloring Problem , 2008, INFORMS J. Comput..

[6]  Jin-Kao Hao,et al.  Improving the extraction and expansion method for large graph coloring , 2012, Discret. Appl. Math..

[7]  Charles Fleurent,et al.  Genetic and hybrid algorithms for graph coloring , 1996, Ann. Oper. Res..

[8]  Nicolas Zufferey,et al.  Graph colouring approaches for a satellite range scheduling problem , 2008, J. Sched..

[9]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..

[10]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[11]  Alain Hertz,et al.  An adaptive memory algorithm for the k-coloring problem , 2003, Discret. Appl. Math..

[12]  Jin-Kao Hao,et al.  An Extraction and Expansion Approach for Graph Coloring , 2013, Asia Pac. J. Oper. Res..

[13]  Daniel Brélaz,et al.  New methods to color the vertices of a graph , 1979, CACM.

[14]  Alain Hertz,et al.  Using tabu search techniques for graph coloring , 1987, Computing.

[15]  Jin-Kao Hao,et al.  A New Genetic Local Search Algorithm for Graph Coloring , 1998, PPSN.

[16]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[17]  Yun Peng,et al.  VColor: A practical vertex-cut based approach for coloring large graphs , 2016, 2016 IEEE 32nd International Conference on Data Engineering (ICDE).

[18]  Kaile Su,et al.  A Reduction based Method for Coloring Very Large Graphs , 2017, IJCAI.

[19]  Jin-Kao Hao,et al.  A memetic algorithm for graph coloring , 2010, Eur. J. Oper. Res..

[20]  Derek H. Smith,et al.  Improving heuristics for the frequency assignment problem , 1998, Eur. J. Oper. Res..

[21]  Pierre Hansen,et al.  Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results , 2005, Discret. Optim..

[22]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[23]  Frank Thomson Leighton,et al.  A Graph Coloring Algorithm for Large Scheduling Problems. , 1979, Journal of research of the National Bureau of Standards.

[24]  Anurag Verma,et al.  Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks , 2015, INFORMS J. Comput..

[25]  Isabel Méndez-Díaz,et al.  A Branch-and-Cut algorithm for graph coloring , 2006, Discret. Appl. Math..

[26]  Jin-Kao Hao,et al.  An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring , 2010, Comput. Oper. Res..

[27]  Jin-Kao Hao,et al.  Tabu Search for Graph Coloring, T-Colorings and Set T-Colorings , 1999 .

[28]  Jin-Kao Hao,et al.  Coloring large graphs based on independent set extraction , 2012, Comput. Oper. Res..

[29]  D. Werra,et al.  Some experiments with simulated annealing for coloring graphs , 1987 .

[30]  Federico Malucelli,et al.  Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation , 2012, INFORMS J. Comput..

[31]  Jin-Kao Hao,et al.  Adaptive Tabu Search for course timetabling , 2010, Eur. J. Oper. Res..

[32]  Nicolas Zufferey,et al.  A graph coloring heuristic using partial solutions and a reactive tabu scheme , 2008, Comput. Oper. Res..

[33]  Ryan A. Rossi,et al.  Coloring large complex networks , 2014, Social Network Analysis and Mining.

[34]  Dominique de Werra,et al.  On a Graph-theoretical Model for Cyclic Register Allocation , 1999, Discret. Appl. Math..

[35]  Victor A. Campos,et al.  On the asymmetric representatives formulation for the vertex coloring problem , 2005, Discret. Appl. Math..