Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Breaking Instance-Independent Symmetries in Exact Graph Coloring Arathi Ramani
 

Summary: Breaking Instance-Independent Symmetries in Exact Graph Coloring
Arathi Ramani

, Fadi A. Aloul, Igor L. Markov

and Karem A. Sakallah


Department of EECS, University of Michigan, Ann Arbor, USA
Department of Computer Engineering, American University in Sharjah, UAE°
ramania, faloul, imarkov, karemĘ @umich.edu
Abstract
Code optimization and high level synthesis can be posed as constraint satisfaction and opti-
mization problems, such as graph coloring used in register allocation. Graph coloring is also used
to model more traditional CSPs relevant to AI, such as planning, time-tabling and scheduling. Prov-
ably optimal solutions may be desirable for commercial and defense applications. Additionally,
for applications such as register allocation and code optimization, naturally-occurring instances of
graph coloring are often small and can be solved optimally. A recent wave of improvements in algo-
rithms for Boolean satisfiability (SAT) and 0-1 Integer Linear Programming (ILP) suggests generic
problem-reduction methods, rather than problem-specific heuristics, because (1) heuristics may be

  

Source: Aloul, Fadi - Department of Computer Engineering, American University of Sharjah

 

Collections: Engineering