Exploiting hierarchy and structure to efficiently solve graph coloring as SAT.

Miroslav N. Velev

Browse the full ICCAD paper archive.