The Community for Technology Leaders
European Design and Test Conference (1997)
Mar. 17, 1997 to Mar. 20, 1997
ISSN: 1066-1409
ISBN: 0-8186-7786-4
pp: 422
S. Chiusano , Dipartimento di Autom. e Inf., Politecnico di Torino, Italy
F. Corno , Dipartimento di Autom. e Inf., Politecnico di Torino, Italy
P. Prinetto , Dipartimento di Autom. e Inf., Politecnico di Torino, Italy
M. Sonza Reorda , Dipartimento di Autom. e Inf., Politecnico di Torino, Italy
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.
INDEX TERMS
graph colouring; hybrid technique; graph coloring; BDD; symbolic manipulation; explicit solving algorithm; hard-to-solve problem; CAD; VLSI; optimization
CITATION

F. Corno, P. Prinetto, S. Chiusano and M. Sonza Reorda, "Hybrid symbolic-explicit techniques for the graph coloring problem," European Design and Test Conference(EDTC), vol. 00, no. , pp. 422, 1997.
doi:10.1109/EDTC.1997.582394
101 ms
(Ver 3.3 (11022016))