New methods to color the vertices of a graph
Communications of the ACM
A generalized implicit enumeration algorithm for graph coloring
Communications of the ACM - Lecture notes in computer science Vol. 174
Bounding the Maximum Size of a Packet Radio Network
IEEE Transactions on Computers
Exact coloring of real-life graphs is easy
DAC '97 Proceedings of the 34th annual Design Automation Conference
Efficient coloring of a large spectrum of graphs
DAC '98 Proceedings of the 35th annual Design Automation Conference
Reactive GRASP with path relinking for channel assignment in mobile phone networks
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Finding the chromatic number by means of critical graphs
Journal of Experimental Algorithmics (JEA)
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
A semidefinite programming-based heuristic for graph coloring
Discrete Applied Mathematics
Efficient algorithms for finding critical subgraphs
Discrete Applied Mathematics
Variable space search for graph coloring
Discrete Applied Mathematics
Maximization of energy efficiency in wireless ad hoc and sensor networks with SERENA
Mobile Information Systems - Advances in Wireless Networks
Using local search to speed up filtering algorithms for some NP-hard constraints
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
An analysis of heuristics for vertex colouring
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Using hajós' construction to generate hard graph 3-colorability instances
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
| Hi-index | 48.22 |
Brelaz's modification of Brown's exact coloring algorithm contains two errors as demonstrated in two examples. A correct version of the algorithm and a proof of the exactness are given. Finally, Brown's look-ahead rule is built into this algorithm.