Backtracking through biconnected components of a constraint graph

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2001, Pages 291-296

  Baget, Jean François ^a   Tognetti, Yannic S ^a  

^a LIRMM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BICONNECTED COMPONENTS; CONSTRAINT GRAPH; GLOBAL KNOWLEDGE; LOCAL INFORMATION; OPTIMAL TIME COMPLEXITY; OVERHEAD COSTS; SEARCH SPACES;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; CRYSTAL STRUCTURE; TREES (MATHEMATICS);

CONSTRAINT THEORY;

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

References (11)

1. R. Dechter and D. Frost. Backtracking Algorithms for Constraint Satisfaction Problems. ICS technical report, University of California, 1999.
2. R. Dechter and J. Pearl. Network-Based Heuristics for Constraint Satisfaction Problems. Artficial Intelligence, 34(1):1-38, 1988.
3. R. Dechter. Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset Decomposition. Artificial Intelligence, 41(3):273-312, January 1990. (Pubitemid 20647477)
4. E. C. Freuder. A Sufficient Condition for Backtrack-Free Search. Journal of the ACM, 29(1):24-32, January 1982.
5. J. Gaschnig. Performance measurement and analysis of certain search algorithms. Research report CMU-CS-79-124, Carnegie-Mellon University, 1979.
6. G. Gottlob, N. Leone, and F. Scarcello. A Comparison of Structural CSP Decomposition Methods. In Proc. of IJCAI'99, pages 394-399, 1999.
7. A.K. Mackworth and E. C. Freuder. The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artificial Intelligence, 25, 1985.
8. P. Prosser. Hybrid Algorithms for the Constraint Satisfaction Problem. Computational Intelligence, 9(3):268-299, 1993.
9. D. Sabin and E. C. Freuder. Contradicting Conventional Wisdom in Constraint Satisfaction. In Proc. of ECAI'94, pages 125-129, 1994.
10. B. Smith. Locating the Phase Transition in Binary Constraint Satisfaction Problems. Artificial Intelligence, 81:155-181, 1996. (Pubitemid 126349553)
11. R. E. Tarjan. Depth-First Search and Linear Graph Algorithms. SIAM J. of Computing, 1:146-160, 1972.