An incremental search heuristic for coloring vertices of a graph

DOI10.1007/978-3-030-63072-0_4zbMath1491.05077OpenAlexW3135450210MaRDI QIDQ2056884

Sasthi C. Ghosh, Subhankar Ghosal

Publication date: 8 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-63072-0_4

zbMATH Keywords

heuristic algorithmvertex coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using tabu search techniques for graph coloring
• Some experiments with simulated annealing for coloring graphs
• A memetic algorithm for graph coloring
• An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm
• New integer linear programming models for the vertex coloring problem
• Coloring graphs by iterated local search traversing feasible and infeasible solutions
• Constructive generation of very hard 3-colorability instances
• A survey of local search methods for graph coloring
• A systematic study on meta-heuristic approaches for solving the graph coloring problem
• Linear degree extractors and the inapproximability of max clique and chromatic number
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• New methods to color the vertices of a graph
• A Column Generation Approach for Graph Coloring
• Reducibility among Combinatorial Problems
• An upper bound for the chromatic number of a graph and its application to timetabling problems
• The chromatic number of random graphs

This page was built for publication: An incremental search heuristic for coloring vertices of a graph