Publisher
Springer Berlin Heidelberg
Reference6 articles.
1. Lecture Notes in Computer Science;I.D. Aron,2006
2. Chudnovsky, M., Robertson, N., Seymour, P.D., Thomas, R.: Progress on Perfect Graphs. Mathematical Programming 97, 405–422 (2003)
3. Chvatal, V.: On certain polytopes associated with graphs. Combinatorial Theory B 18, 138–154 (1975)
4. Dechter, R., Pearl, J.: Tree clustering for constraint networks. Artificial Intelligence 38, 353–366 (1989)
5. Freuder, E.C.: Complexity of k-tree structured constraint satisfaction problems. In: AAAI, pp. 4–9 (1990)