A NEW APPROACH TO THE VERTEX COLORING PROBLEM
From MaRDI portal
Publication:2790363
DOI10.1080/01969722.2013.803391zbMath1331.68289OpenAlexW2046652778MaRDI QIDQ2790363
Publication date: 4 March 2016
Published in: Cybernetics and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01969722.2013.803391
Formal languages and automata (68Q45) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15) Approximation algorithms (68W25)
Related Items
Cellular adaptive Petri net based on learning automata and its application to the vertex coloring problem ⋮ A NEW APPROACH TO THE VERTEX COLORING PROBLEM
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Evolutionary graph colouring
- Using tabu search techniques for graph coloring
- Finding minimum weight connected dominating set in stochastic graph based on learning automata
- An introduction to timetabling
- The graph coloring problem: A neuronal network approach
- Random sampling of colourings of sparse random graphs with a constant number of colours
- An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables
- On the tractability of coloring semirandom graphs
- A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing
- Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems
- On a parallel genetic-tabu search based algorithm for solving the graph colouring problem
- Graph coloring with adaptive evolutionary algorithms
- A robust simulated annealing based examination timetabling system.
- Balanced colourings of strongly regular graphs
- On local search for the generalized graph coloring problem
- Genetic and hybrid algorithms for graph coloring
- Hybrid evolutionary algorithms for graph coloring
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- CHECKCOL: improved local search for graph coloring
- Generalised graph colouring by a hybrid of local search and constraint programming
- A cutting plane algorithm for graph coloring
- A semidefinite programming-based heuristic for graph coloring
- An ant-based algorithm for coloring graphs
- Coloring graphs by iterated local search traversing feasible and infeasible solutions
- Another look at graph coloring via propositional satisfiability
- An adaptive memory algorithm for the \(k\)-coloring problem
- Graph coloring in the estimation of sparse derivative matrices: Instances and applications
- An improved ant colony optimisation heuristic for graph colouring
- An evolutionary approach for bandwidth multicoloring problems
- Embedding a novel objective function in a two-phased local search for robust vertex coloring
- A survey of local search methods for graph coloring
- On Markov Chains for Randomly H-Coloring a Graph
- A NEW APPROACH TO THE VERTEX COLORING PROBLEM
- Improper Colourings of Unit Disk Graphs
- On the Behavior of a Learning Automaton in a Changing Environment with Application to Telephone Traffic Routing
- A graph coloring algorithm for large scheduling problems
- Learning Algorithms for Two-Person Zero-Sum Stochastic Games with Incomplete Information: A Unified Approach
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Bounds on the Convergence Probabilities of Learning Automata
- New methods to color the vertices of a graph
- A Column Generation Approach for Graph Coloring
- A new kind of graph coloring
- Chromatic Scheduling and the Chromatic Number Problem
