Breaking instance-independent symmetries in exact graph coloring

@article{Aloul2004BreakingIS,
  title={Breaking instance-independent symmetries in exact graph coloring},
  author={Fadi A. Aloul and Igor L. Markov and Arathi Ramani and Karem A. Sakallah},
  journal={Proceedings Design, Automation and Test in Europe Conference and Exhibition},
  year={2004},
  volume={1},
  pages={324-329 Vol.1}
}
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Naturally-occurringinstances of such problems are often small and can be solved optimally. A recent wave of improvements in algorithms for Boolean satisfiability (SAT) and 0-1 ILP suggests generic problem-reduction methods, rather than problem-specific heuristics, because (1) heuristics are easily upset by new constraints, (2… CONTINUE READING
Highly Cited
This paper has 53 citations. REVIEW CITATIONS
30 Citations
4 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 30 extracted citations

53 Citations

0510'08'11'14'17
Citations per Year
Semantic Scholar estimates that this publication has 53 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Symmetry in not-equals binary constraint networks

  • B. Benhamou
  • Workshop on Symmetry in CSPs, pp. 2–8.
  • 2004
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…