Perfect Constraints Are Tractable
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 stru...
| Main Authors: | , |
|---|---|
| Format: | Conference item |
| Published: |
Springer
2008
|