The Complexity of Near-Optimal Graph Coloring
Journal of the ACM (JACM)
A correction to Brelaz's modification of Brown's coloring algorithm
Communications of the ACM
New methods to color the vertices of a graph
Communications of the ACM
Graph theory: An algorithmic approach (Computer science and applied mathematics)
Graph theory: An algorithmic approach (Computer science and applied mathematics)
Bounding the Maximum Size of a Packet Radio Network
IEEE Transactions on Computers
Solving the Minimum Weighted Integer Coloring Problem
Computational Optimization and Applications
Assigning codes in wireless networks: bounds and scaling properties
Wireless Networks
An accurate evaluation of routing density for symmetrical FPGAs
GLSVLSI '01 Proceedings of the 11th Great Lakes symposium on VLSI
A router for symmetrical FPGAs based on exact routing density evaluation
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
A Fast and Simple Local Search for Graph Coloring
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Finding the chromatic number by means of critical graphs
Journal of Experimental Algorithmics (JEA)
CeRA: A Router for Symmetrical FPGAs Based on Exact Routing Density Evaluation
IEEE Transactions on Computers
An exact method for graph coloring
Computers and Operations Research
A branch-and-cut algorithm for graph coloring
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
A cutting plane algorithm for graph coloring
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
Enhancing PC Cluster-Based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Combinatorial optimization in system configuration design
Automation and Remote Control
Breaking instance-independent symmetries in exact graph coloring
Journal of Artificial Intelligence Research
Tractable symmetry breaking for CSPs with interchangeable values
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Subspace partitioning for target detection and identification
IEEE Transactions on Signal Processing
A Branch-and-Cut algorithm for graph coloring
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
A wide-ranging computational comparison of high-performance graph colouring algorithms
Computers and Operations Research
A new neighborhood based on improvement graph for robust graph coloring problem
AI'04 Proceedings of the 17th Australian joint conference on Advances in Artificial Intelligence
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 | 0.01 |
A generalized algorithm for graph coloring by implicit enumeration is formulated. A number of backtracking sequential methods are discussed in terms of the generalized algorithm. Some are revealed to be partially correct and inexact. A few corrections to the invalid algorithms, which cause these algorithms to guarantee optimal solutions, are proposed. Finally, some computational results and remarks on the practical relevance of improved implicit enumeration algorithms are given.