Abstract
By using recent results from graph theory, including the Strong Perfect Graph Theorem, we obtain a unifying framework for a number of tractable classes of constraint problems. These include problems with chordal microstructure; problems with chordal microstructure complement; problems with tree structure; and the "all-different" constraint. In each of these cases we show that the associated microstructure of the problem is a perfect graph, and hence they are all part of the same larger family of tractable problems. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Salamon, A. Z., & Jeavons, P. G. (2008). Perfect constraints are tractable. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5202 LNCS, pp. 524–528). https://doi.org/10.1007/978-3-540-85958-1_35
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
