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

Miroslav N. Velev (2007)

Details and statistics

DOI: 10.1109/ICCAD.2007.4397256

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-24

a service of  Schloss Dagstuhl - Leibniz Center for Informatics