New methods to color the vertices of a graph

Authors:
Daniel Brélaz
Affiliations:
École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland
Venue:
Communications of the ACM
Year:
1979

Citing 1
Cited 249

Graphs and Hypergraphs

Graphs and Hypergraphs

Optimization of parser tables for portable compilers

ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
A generalized implicit enumeration algorithm for graph coloring

Communications of the ACM - Lecture notes in computer science Vol. 174
Distributed algorithms for load balancing in very large homogeneous systems

ACM '87 Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow
Bounding the Maximum Size of a Packet Radio Network

IEEE Transactions on Computers
Spill code minimization techniques for optimizing compliers

PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
IDRP protocol analysis: storage complexity

ACM SIGCOMM Computer Communication Review
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
The constrainedness knife-edge

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Which search problems are random?

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Solving the Minimum Weighted Integer Coloring Problem

Computational Optimization and Applications
Assigning codes in wireless networks: bounds and scaling properties

Wireless Networks
Smallest-last ordering and clustering and graph coloring algorithms

Journal of the ACM (JACM)
A fast probabilistic algorithm for four-coloring large planar graphs

ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Forensic engineering techniques for VLSI CAD tools

Proceedings of the 37th Annual Design Automation Conference
Ant algorithms for discrete optimization

Artificial Life
Generalized map coloring for use in geographical information systems

Proceedings of the 8th ACM international symposium on Advances in geographic information systems
A correction to Brelaz's modification of Brown's coloring algorithm

Communications of the ACM
A new paradigm for dichotomy-based constrained encoding

Proceedings of the conference on Design, automation and test in Europe
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
Almost all graphs with average degree 4 are 3-colorable

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Ensemble planning for digital audio broadcasting

Handbook of wireless networks and mobile computing
A GRASP for Coloring Sparse Graphs

Computational Optimization and Applications
Experimental analysis of simple, distributed vertex coloring algorithms

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Graph coloring in J: an introduction

Proceedings of the 2001 conference on APL: an arrays odyssey
Mappings for conflict-free access of paths in bidimensional arrays, circular lists, and complete trees

Journal of Parallel and Distributed Computing
Coloration Neighbourhood Search With Forward Checking

Annals of Mathematics and Artificial Intelligence
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems

Journal of Automated Reasoning
Graph Coloring with Adaptive Evolutionary Algorithms

Journal of Heuristics
A parallel Gauss-Seidel algorithm for sparse power system matrices

Proceedings of the 1994 ACM/IEEE conference on Supercomputing
Interprocedural compatibility analysis for static object preallocation

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Survey of Automated Timetabling

Artificial Intelligence Review
Parallel Simulated Annealing Algorithms for Cell Placement on Hypercube Multiprocessors

IEEE Transactions on Parallel and Distributed Systems
An information-based neural approach to generic constraint satisfaction

Artificial Intelligence
An Experimental Investigation of Iterated Local Search for Coloring Graphs

Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
An Evolutionary Annealing Approach to Graph Coloring

Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
A Method for Register Allocation to Loops in Multiple Register File Architectures

IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Minimal CDMA Recoding Strategies in Power-Controlled Ad-Hoc Wireless Networks

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Multiple Populations Guided by the Constraint-Graph for CSP

IBERAMIA-SBIA '00 Proceedings of the International Joint Conference, 7th Ibero-American Conference on AI: Advances in Artificial Intelligence
Efficient Graph Coloring by Evolutionary Algorithms

Proceedings of the 6th International Conference on Computational Intelligence, Theory and Applications: Fuzzy Days
Inheriting Parents Operators: A New Dynamic Strategy for Improving Evolutionary Algorithms

ISMIS '02 Proceedings of the 13th International Symposium on Foundations of Intelligent Systems
A Generic Object-Oriented Constraint-Based Model for University Course Timetabling

PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
A Grouping Genetic Algorithm for Graph Colouring and Exam Timetabling

PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
Statistical Study of the Correlation Between Topology and Wavelength Usage in Optical Networks with and without Conversion

NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
A Fast and Simple Local Search for Graph Coloring

WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
The Dynamics of Dynamic Variable Ordering Heuristics

CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
An Empirical Study of Probabilistic Arc Consistency

CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Scatter Search for Graph Coloring

Selected Papers from the 5th European Conference on Artificial Evolution
Computational Forensic Techniques for Intellectual Property Protection

IHW '01 Proceedings of the 4th International Workshop on Information Hiding
Gambit: A Tool for the Simultaneous Placement and Detailed Routing of Gate-Arrays

FPL '01 Proceedings of the 11th International Conference on Field-Programmable Logic and Applications
Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Evaluating Migration Strategies for an Evolutionary Algorithm Based on the Constraint-Graph that Solves CSP

ISMIS '00 Proceedings of the 12th International Symposium on Foundations of Intelligent Systems
The Probabilistic Analysis of a Greedy Satisfiability Algorithm

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Graph coloring with quantum heuristics

Eighteenth national conference on Artificial intelligence
The interface between P and NP: COL, XOR, NAE, 1-in-k, and Horn SAT

Eighteenth national conference on Artificial intelligence
Minimizing ROBDD Sizes of Incompletely Specified Boolean Functions by Exploiting Strong Symmetries

EDTC '97 Proceedings of the 1997 European conference on Design and Test
Solving the Maximum Clique Problem using PUBB

IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Genetic algorithms and timetabling

Advances in evolutionary computing
Finding the chromatic number by means of critical graphs

Journal of Experimental Algorithmics (JEA)
Fuzzy rrDFCSP and planning

Artificial Intelligence - Special issue: Fuzzy set and possibility theory-based methods in artificial intelligence
Almost all graphs with average degree 4 are 3-colorable

Journal of Computer and System Sciences - STOC 2002
A Range-Compaction Heuristic for Graph Coloring

Journal of Heuristics
Modeling and formal verification of embedded systems based on a Petri net representation

Journal of Systems Architecture: the EUROMICRO Journal - Special issue: Synthesis and verification
Heuristics and lower bounds for the bin packing problem with conflicts

Computers and Operations Research
An analysis of solution properties of the graph coloring problem

Metaheuristics
Dynamic FPGA routing for just-in-time FPGA compilation

Proceedings of the 41st annual Design Automation Conference
A novel FPGA local interconnect test scheme and automatic TC derivation/generation

Journal of Systems Architecture: the EUROMICRO Journal - Special issue: Desing and test of systems on a chip
Gradual Relaxation Techniques with Applications to Behavioral Synthesis

Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Distributed computation of shared backup path in mesh optical networks using probabilistic methods

IEEE/ACM Transactions on Networking (TON)
Constraint Solving for Proof Planning

Journal of Automated Reasoning
Joint routing and wavelength assignment in wavelength division multiplexing networks for permanent and reliable paths

Computers and Operations Research
3-Coloring and 3-clique-ordering of locally connected graphs

Journal of Algorithms
Heuristic methods for graph coloring problems

Proceedings of the 2005 ACM symposium on Applied computing
Interactive collision detection between deformable models using chromatic decomposition

ACM SIGGRAPH 2005 Papers
On the wireless local area network design problem with performance guarantees

Computer Networks: The International Journal of Computer and Telecommunications Networking
The probabilistic analysis of a greedy satisfiability algorithm

Random Structures & Algorithms
An exact method for graph coloring

Computers and Operations Research
Symmetry Breaking Constraints for Value Symmetries in Constraint Satisfaction

Constraints
The Impact of Search Heuristics on Heavy-Tailed Behaviour

Constraints
A branch-and-cut algorithm for graph coloring

Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
A survey of local search methods for graph coloring

Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Warp Processors

Proceedings of the 41st annual Design Automation Conference
An agent-based algorithm for generalized graph colorings

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Hierarchical variable ordering for distributed constraint optimization

AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Achieving realtime capabilities in ethernet networks by edge-coloring of communication conflict-multigraphs

PDCN'06 Proceedings of the 24th IASTED international conference on Parallel and distributed computing and networks
Propositional Satisfiability and Constraint Programming: A comparative survey

ACM Computing Surveys (CSUR)
Fast continuous collision detection among deformable models using graphics processors

Computers and Graphics
A hybrid parallel genetic algorithm approach for graph coloring

International Journal of Knowledge-based and Intelligent Engineering Systems
The minimum consistent subset cover problem and its applications in data mining

Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
A graph coloring heuristic using partial solutions and a reactive tabu scheme

Computers and Operations Research
Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates

Computers and Operations Research
Coordinated fractional frequency reuse

Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
An adaptive memory algorithm for the k-coloring problem

Discrete Applied Mathematics
Graph coloring in the estimation of sparse derivative matrices: Instances and applications

Discrete Applied Mathematics
Generalised graph colouring by a hybrid of local search and constraint programming

Discrete Applied Mathematics
A cutting plane algorithm for graph coloring

Discrete Applied Mathematics
A semidefinite programming-based heuristic for graph coloring

Discrete Applied Mathematics
An ant-based algorithm for coloring graphs

Discrete Applied Mathematics
Coloring graphs by iterated local search traversing feasible and infeasible solutions

Discrete Applied Mathematics
Constructive generation of very hard 3-colorability instances

Discrete Applied Mathematics
An improved ant colony optimisation heuristic for graph colouring

Discrete Applied Mathematics
Enhancing solution quality of the biobjective graph coloring problem using hybridization of EA: biobjective graph coloring problem

Proceedings of the 10th annual conference on Genetic and evolutionary computation
Hyper-heuristics for the dynamic variable ordering in constraint satisfaction problems

Proceedings of the 10th annual conference on Genetic and evolutionary computation
Power-gating-aware high-level synthesis

Proceedings of the 13th international symposium on Low power electronics and design
Graph colouring approaches for a satellite range scheduling problem

Journal of Scheduling
On the recursive largest first algorithm for graph colouring

International Journal of Computer Mathematics
Embracing interference in ad hoc networks using joint routing and scheduling with multiple packet reception

Ad Hoc Networks
A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing

Computers and Operations Research
Using Hyper-heuristics for the Dynamic Variable Ordering in Binary Constraint Satisfaction Problems

MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
A Vector Assignment Approach for the Graph Coloring Problem

Learning and Intelligent Optimization
A survey of search methodologies and automated system development for examination timetabling

Journal of Scheduling
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
A multi-objective evolutionary algorithm for examination timetabling

Journal of Scheduling
Exploiting weak dependencies in tree-based search

Proceedings of the 2009 ACM symposium on Applied Computing
A Critical Element-Guided Perturbation Strategy for Iterated Local Search

EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
Maximization of energy efficiency in wireless ad hoc and sensor networks with SERENA

Mobile Information Systems - Advances in Wireless Networks
Last Conflict based Reasoning

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Guiding Search using Constraint-level Advice

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Evolution of hyperheuristics for the biobjective graph coloring problem using multiobjective genetic programming

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Hybrid Evolutionary Algorithm for the Graph Coloring Register Allocation Problem for Embedded Systems

Transactions on Computational Science V
AND/OR Branch-and-Bound search for combinatorial optimization in graphical models

Artificial Intelligence
Models and heuristic algorithms for a weighted vertex coloring problem

Journal of Heuristics
Managing Diversity on an AIS That Solves 3-Colouring Problems

ICARIS '09 Proceedings of the 8th International Conference on Artificial Immune Systems
A new incomplete method for CSP inconsistency checking

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Breaking instance-independent symmetries in exact graph coloring

Journal of Artificial Intelligence Research
Solving strategies for highly symmetric CSPs

IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Search in a small world

IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Nogood recording from restarts

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Information-theoretic approaches to branching in search

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Register allocation for high-level synthesis using dual supply voltages

Proceedings of the 46th Annual Design Automation Conference
A search space "cartography" for guiding graph coloring heuristics

Computers and Operations Research
Backbones in optimization and approximation

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Search on high degree graphs

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Optimal refutations for constraint satisfaction problems

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Reasoning from last conflict(s) in constraint programming

Artificial Intelligence
On the wireless local area network design problem with performance guarantees

Computer Networks: The International Journal of Computer and Telecommunications Networking
Subspace partitioning for target detection and identification

IEEE Transactions on Signal Processing
On the impact of introducing advanced devices into a cognitive radio network

SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
An efficient multiuser scheduling scheme for MIMO-CDMA wireless systems

WTS'09 Proceedings of the 2009 conference on Wireless Telecommunications Symposium
A QoS network architecture to interconnect large-scale VLSI neural networks

IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks
A Branch-and-Cut algorithm for graph coloring

Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
Scheduling Constraints and Interference Graph Properties for Graph-based Interference Coordination in Cellular OFDMA Networks

Mobile Networks and Applications
Grasp and Guided Local Search for the examination timetabling problem

International Journal of Artificial Intelligence and Soft Computing
Algorithms and experiments on colouring squares of planar graphs

WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Register allocation by optimal graph coloring

CC'03 Proceedings of the 12th international conference on Compiler construction
Interconnecting VLSI spiking neural networks using isochronous connections

IWANN'07 Proceedings of the 9th international work conference on Artificial neural networks
Parallelization techniques for tabu search

PARA'06 Proceedings of the 8th international conference on Applied parallel computing: state of the art in scientific computing
Channel adaptive real-time MAC protocols for a two-level heterogeneous wireless network

HiPC'07 Proceedings of the 14th international conference on High performance computing
Linear linkage encoding in grouping problems: applications on graph coloring and timetabling

PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
Parallel immune system for graph coloring

SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Heuristics for the bandwidth colouring problem

International Journal of Metaheuristics
A graph approach to dynamic fractional frequency reuse (FFR) in multi-cell OFDMA networks

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
HLS-l: a high-level synthesis framework for latch-based architectures

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Frame-based multicast switching

IEEE Communications Letters
Selection mechanisms in memory consideration for examination timetabling with harmony search

Proceedings of the 12th annual conference on Genetic and evolutionary computation
Energy, bandwidth and time efficiency in data gathering applications

WD'09 Proceedings of the 2nd IFIP conference on Wireless days
Versatile publishing for privacy preservation

Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Interleaving solving and elicitation of constraint satisfaction problems based on expected cost

Constraints
On the application of graph colouring techniques in round-robin sports scheduling

Computers and Operations Research
Multi-objective Genetic Algorithms for grouping problems

Applied Intelligence
A novel frequency planning algorithm for mitigating unfairness in wireless LANs

Computer Networks: The International Journal of Computer and Telecommunications Networking
Concurrency and network disassortativity

Artificial Life
Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method

AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Detecting unsatisfiable CSPs by coloring the micro-structure

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Parallel graph component labelling with GPUs and CUDA

Parallel Computing
HLS-l: high-level synthesis of high performance latch-based circuits

Proceedings of the Conference on Design, Automation and Test in Europe
Evaluating and Improving Modern Variable and Revision Ordering Strategies in CSPs

Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Energy efficient transmission scheduling for infrastructure sensor nodes in location systems

Computer Networks: The International Journal of Computer and Telecommunications Networking
The constrainedness of search

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
The very particular structure of the very hard instances

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Pitfalls in instance generation for udine timetabling

LION'10 Proceedings of the 4th international conference on Learning and intelligent optimization
How can bees colour graphs

International Journal of Bio-Inspired Computation
Brief paper: Formation control using range-only measurements

Automatica (Journal of IFAC)
A cellular learning automata-based algorithm for solving the vertex coloring problem

Expert Systems with Applications: An International Journal
Three heuristics to solve Timetabling

ICCOM'06 Proceedings of the 10th WSEAS international conference on Communications
Comparing the best maximum clique finding algorithms, which are using heuristic vertex colouring

ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Graph k-colorability through threshold accepting and Davis-Putnam

CIMMACS'05 Proceedings of the 4th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics
Population-based and learning-based metaheuristic algorithms for the graph coloring problem

Proceedings of the 13th annual conference on Genetic and evolutionary computation
An efficient hierarchical parallel genetic algorithm for graph coloring problem

Proceedings of the 13th annual conference on Genetic and evolutionary computation
On the idea of evolving decision matrix hyper-heuristics for solving constraint satisfaction problems

Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Evolution of neural networks topologies and learning parameters to produce hyper-heuristics for constraint satisfaction problems

Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Cliques with maximum/minimum edge neighborhood and neighborhood density

Computers and Operations Research
Safe lower bounds for graph coloring

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts

INFORMS Journal on Computing
Frequency allocation problem in a SDMA satellite communication system

Computers and Industrial Engineering
Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz

Journal of Symbolic Computation
A new DSATUR-based algorithm for exact vertex coloring

Computers and Operations Research
Probabilistic arc consistency: a connection between constraint reasoning and probabilistic reasoning

UAI'00 Proceedings of the Sixteenth conference on Uncertainty in artificial intelligence
Algorithm portfolio design: theory vs. practice

UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
Note: Three new upper bounds on the chromatic number

Discrete Applied Mathematics
New order-based crossovers for the graph coloring problem

PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Generalizing alldifferent: the somedifferent constraint

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Cell segmentation using coupled level sets and graph-vertex coloring

MICCAI'06 Proceedings of the 9th international conference on Medical Image Computing and Computer-Assisted Intervention - Volume Part I
Heuristic colour assignment strategies for merge models in graph colouring

EvoCOP'05 Proceedings of the 5th European conference on Evolutionary Computation in Combinatorial Optimization
Relative generic computational forensic techniques

IH'04 Proceedings of the 6th international conference on Information Hiding
A wide-ranging computational comparison of high-performance graph colouring algorithms

Computers and Operations Research
On the problem of channel assignment for Multi-NIC multihop wireless networks

MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
Combinatorial algorithms for the maximum k-plex problem

Journal of Combinatorial Optimization
Further results on swarms solving graph coloring

ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part III
An analysis of heuristics for vertex colouring

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Confluent layered drawings

GD'04 Proceedings of the 12th international conference on Graph Drawing
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
Low-cost design approach to WDM mesh networks

ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
Wavelength assignment in route-fixed optical WDM ring by a branch-and-price algorithm

ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
On the use of multi neighbourhood structures within a Tabu-based memetic approach to university timetabling problems

Information Sciences: an International Journal
Efficient on-line module-level wake-up scheduling for high performance multi-module designs

Proceedings of the 2012 ACM international symposium on International Symposium on Physical Design
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
Variable and value ordering decision matrix hyper-heuristics: a local improvement approach

MICAI'11 Proceedings of the 10th Mexican international conference on Advances in Artificial Intelligence - Volume Part I
Trying again to fail-first

CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
Examination timetabling with fuzzy constraints

PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
Improving graph colouring algorithms and heuristics using a novel representation

EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Constraint-based Very Large-Scale Neighborhood search

Constraints
An empirical comparison of some approximate methods for graph coloring

HAIS'12 Proceedings of the 7th international conference on Hybrid Artificial Intelligent Systems - Volume Part I
A modular memory optimization for synchronous data-flow languages: application to arrays in a lustre compiler

Proceedings of the 13th ACM SIGPLAN/SIGBED International Conference on Languages, Compilers, Tools and Theory for Embedded Systems
A hybrid artificial bee colony algorithm for graph 3-coloring

SIDE'12 Proceedings of the 2012 international conference on Swarm and Evolutionary Computation
Survey: The cook-book approach to the differential equation method

Computer Science Review
An exact approach for the Vertex Coloring Problem

Discrete Optimization
Information-theoretic approaches to branching in search

Discrete Optimization
A sequential elimination algorithm for computing bounds on the clique number of a graph

Discrete Optimization
Cosine: A new graph coloring algorithm

Operations Research Letters
An algorithm for finding a maximum clique in a graph

Operations Research Letters
On the efficiency of an order-based representation in the clique covering problem

Proceedings of the 14th annual conference on Genetic and evolutionary computation
Improving the performance of vector hyper-heuristics through local search

Proceedings of the 14th annual conference on Genetic and evolutionary computation
Optimization of analytic window functions

Proceedings of the VLDB Endowment
Improving the extraction and expansion method for large graph coloring

Discrete Applied Mathematics
Weighted improper colouring

Journal of Discrete Algorithms
Fast continuous collision detection among deformable models using graphics processors

EGVE'06 Proceedings of the 12th Eurographics conference on Virtual Environments
Counting-based search: branching heuristics for constraint satisfaction problems

Journal of Artificial Intelligence Research
Graph coloring algorithms for multi-core and massively multithreaded architectures

Parallel Computing
Stochastic Learning for SAT-Encoded Graph Coloring Problems

International Journal of Applied Metaheuristic Computing
A Study of Tabu Search for Coloring Random 3-Colorable Graphs Around the Phase Transition

International Journal of Applied Metaheuristic Computing
Solving graph coloring problem by fuzzy clustering-based genetic algorithm

SEAL'12 Proceedings of the 9th international conference on Simulated Evolution and Learning
Using GRASP to solve the generalised graph colouring problem with application to cell site assignment

International Journal of Mobile Network Design and Innovation
Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm

Computational Optimization and Applications
Solving clique covering in very large sparse random graphs by a technique based on k-fixed coloring tabu search

EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
Characterization of graph properties for improved Pareto fronts using heuristics and EA for bi-objective graph coloring problem

Applied Soft Computing
HLS-dv: a high-level synthesis framework for dual-Vdd architectures

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Stability of FIPP p-cycles under dynamic traffic in WDM networks: dynamic traffic,failure-independent path-protecting (FIPP) p-cycles,path protection,shared bandwidth protection,stability of protection structures

IEEE/ACM Transactions on Networking (TON)
Average-case complexity of backtrack search for coloring sparse random graphs

Journal of Computer and System Sciences
ColPack: Software for graph coloring and related problems in scientific computing

ACM Transactions on Mathematical Software (TOMS)
Channel and Time Slot Allocation for Dense RFID Networks

Wireless Personal Communications: An International Journal
How many wireless resources are needed to resolve the hidden terminal problem?

Computer Networks: The International Journal of Computer and Telecommunications Networking
Towards objective measures of algorithm performance across instance space

Computers and Operations Research
Frequency assignment in a SDMA satellite communication system with beam decentring feature

Computational Optimization and Applications
A hierarchical parallel genetic approach for the graph coloring problem

Applied Intelligence
Algorithms for the maximum k-club problem in graphs

Journal of Combinatorial Optimization
An empirical evaluation of Gravitational Swarm Intelligence for graph coloring algorithm

Neurocomputing

Quantified Score

Hi-index	48.24

Visualization

Abstract

This paper describes efficient new heuristic methods to color the vertices of a graph which rely upon the comparison of the degrees and structure of a graph. A method is developed which is exact for bipartite graphs and is an important part of heuristic procedures to find maximal cliques in general graphs. Finally an exact method is given which performs better than the Randall-Brown algorithm and is able to color larger graphs, and the new heuristic methods, the classical methods, and the exact method are compared.