Efficient coloring of a large spectrum of graphs

Authors:
Darko Kirovski;Miodrag Potkonjak
Affiliations:
Computer Science Department, University of California, Los Angeles, CA;Computer Science Department, University of California, Los Angeles, CA
Venue:
DAC '98 Proceedings of the 35th annual Design Automation Conference
Year:
1998

Citing 8
Cited 19

Using tabu search techniques for graph coloring

Computing
Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
A still better performance guarantee for approximate graph coloring

Information Processing Letters
Exact coloring of real-life graphs is easy

DAC '97 Proceedings of the 34th annual Design Automation Conference
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
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Hidden Cliques as Cryptographic Keys

Hidden Cliques as Cryptographic Keys

Analysis of watermarking techniques for graph coloring problem

Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
Simultaneous shield insertion and net ordering for capacitive and inductive coupling minimization

ISPD '00 Proceedings of the 2000 international symposium on Physical design
Forensic engineering techniques for VLSI CAD tools

Proceedings of the 37th Annual Design Automation Conference
Offline program re-mapping to improve branch prediction efficiency in embedded systems

ASP-DAC '00 Proceedings of the 2000 Asia and South Pacific Design Automation Conference
Hardware metering

Proceedings of the 38th annual Design Automation Conference
Computational Forensic Techniques for Intellectual Property Protection

IHW '01 Proceedings of the 4th International Workshop on Information Hiding
Intellectual Property Metering

IHW '01 Proceedings of the 4th International Workshop on Information Hiding
A Range-Compaction Heuristic for Graph Coloring

Journal of Heuristics
Gradual Relaxation Techniques with Applications to Behavioral Synthesis

Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Simultaneous shield insertion and net ordering for capacitive and inductive coupling minimization

ACM Transactions on Design Automation of Electronic Systems (TODAES)
A method for the minimum coloring problem using genetic algorithms

MS'06 Proceedings of the 17th IASTED international conference on Modelling and simulation
Exploiting hierarchy and structure to efficiently solve graph coloring as SAT

Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Breaking instance-independent symmetries in exact graph coloring

Journal of Artificial Intelligence Research
Information hiding for trusted system design

Proceedings of the 46th Annual Design Automation Conference
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
Multi-objective Genetic Algorithms for grouping problems

Applied Intelligence
A new approach to optical networks security: attack-aware routing and wavelength assignment

IEEE/ACM Transactions on Networking (TON)
RWA on scheduled lightpath demands in WDM optical transport networks with time disjoint paths

ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
RWA algorithm for scheduled lightpath demands in WDM networks

ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We have developed a new algorithm and software for graph coloring by systematically combining several algorithm and software development ideas that had crucial impact on the algorithm's performance. The algorithm explores the divide-and-conquer paradigm, global search for constrained independent sets using a computationally inexpensive objective function, assignment of most-constrained vertices to least-constraining colors, reuse and locality exploration of intermediate solutions, search time management, post-processing lottery-scheduling iterative improvement, and statistical parameter determination and validation. The algorithm was tested on a set of real-life examples. We found that hard-to-color real-life examples are common especially in domains where problem modeling results in denser graphs. Systematic experimentations demonstrated that for numerous instances the algorithm outperformed all other implementations reported in literature in solution quality and run-time.