Hybrid symbolic-explicit techniques for the graph coloring problem

Authors:
S. Chiusano;F. Corno;P. Prinetto;M. Sonza Reorda
Affiliations:
Politecnico di Torino, Dipartimento di Automatica e Informatica, Torino, Italy;Politecnico di Torino, Dipartimento di Automatica e Informatica, Torino, Italy;Politecnico di Torino, Dipartimento di Automatica e Informatica, Torino, Italy;Politecnico di Torino, Dipartimento di Automatica e Informatica, Torino, Italy
Venue:
EDTC '97 Proceedings of the 1997 European conference on Design and Test
Year:
1997

Citing 3
Cited 2

Efficient implementation of a BDD package

DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Symbolic Boolean manipulation with ordered binary-decision diagrams

ACM Computing Surveys (CSUR)
Using symbolic techniques to find the maximum clique in very large sparse graphs

EDTC '95 Proceedings of the 1995 European conference on Design and Test

Efficient Graph Coloring by Evolutionary Algorithms

Proceedings of the 6th International Conference on Computational Intelligence, Theory and Applications: Fuzzy Days
15.2 Low Cost Partial Scan Design: A High Level Synthesis Approach

VTS '98 Proceedings of the 16th IEEE VLSI Test Symposium

Quantified Score

Hi-index	0.02

Visualization

Abstract

This paper presents an algorithmic technique based on hybridizing Symbolic Manipulation Techniques based on BDDs with more traditional Explicit solving algorithms. To validate the approach, the graph coloring problem has been selected as a hard-to-solve problem, and an optimized solution based on hybrid techniques has been implemented. Experimental results on a set of benchmarks derived from the CAD for VLSI area show the applicability of the approach to graphs with millions of vertices in a limited CPU time.