On a generalization of triangulated graphs for domains decomposition of CSPs

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2003, Pages 203-208

  Chmeiss, Assef ^a   Jegou, Philippe ^b   Keddar, Lamia ^b  

^a UNIVERSITÉ D'ARTOIS   (France)

^b AIX MARSEILLE UNIVERSITY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DECOMPOSITION METHODS; GRAPH PARAMETERS; PARALLEL CONFIGURATION; PARALLEL IMPLEMENTATIONS; SEARCH EFFICIENCY; SUB-PROBLEMS;

ARTIFICIAL INTELLIGENCE;

EID: 84880832704     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. S. Arnborg, D.G. Corneil and A. Proskurowski. Complexity of finding embeddings in a k-tree. SIAMJ. Disc. Meth, 8:277-284, 1987.
2. C. Bessiere and J-C. Regin. MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems. In Proceedings of CP'96, LNCS 1118, pages 61-75, Cambridge, MA, USA, 1996.
3. A. Berry. A Wide-range Efficient Algorithm for Minimal Triangulation. In Proceedings of SODA'99 SIAM Conference, USA, 1999.
4. A. Chmeiss and P. Jegou. A Generalization of Chordal Graphs and the Maximum Clique Problem. Information Processing Letters, 62(2):61-66, 1997. (Pubitemid 127410535)
5. R. Dechter and J. Pearl. Tree Clustering for Constraint Networks. Artificial Intelligence, 38:353-366, 1989.
6. D.R. Fulkerson and O. Gross. Incidence matrices and interval graphs. Pacific J. Math., 15:835-855, 1965.
7. F. Gavril. Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph. SIAM J. Cornput, 1(2): 180-187, 1972.
8. Z. Habbas, D. Singer and R. Krajecki. Domain Decomposition for Parallel Resolution of Constraints Satisfaction Problems with OpenMP. In Proceedings of the Second European Workshop on OpenMP, Edinburgh, Scotland, UK, 2000.
9. R. Hamadi. A domain decomposition method to solve n-ary CSPs. In Proceedings of the International Workshop on Constraint-Based Reasonning, FLAIRS-Constraints-96, pages 84-88, Key West Florida, USA, 1996.
10. P. Jegou. Decomposition of domains based on the structure of finite constraints satisfaction problems. In Proceedings of the National Conference on Artificial Intelligence - AAAI '93, pages 731-736, Washington DC, USA, July 1993.
11. P. Prosser. An empirical study of phase transition in binary constraint satisfaction problems. Artificial Intelligence, 81:81-109, 1996. (Pubitemid 126349550)
12. D. Sabin and E. Freuder. Contradicting conventional wisdom in constraint satisfaction. In Proceedings of ECAI'94, pages 125-129, Amsterdam, Holland, 1994.
13. K. Shoikhet and D. Geiger. A practical algorithm for finding optimal triangulation. In Proceedings of AAAI'97, pages 185-190, Providence, USA, 1997.
14. R. Tarjan and M. Yannakakis. Simple Linear-Time Algorithms to test Chordality of graphs, test acyclicity of hypergraph and selectively reduce acycli hypergraph. SIAM Journal on Computing, 13(3):566-579, 1984. (Pubitemid 15514404)