Phase transitions of dominating clique problem and their implications to heuristics in satisfiability search

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2005, Pages 78-83

  Culberson, Joseph ^a   Gao, Yong ^a   Anton, Cǎlin ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CLIQUE PROBLEMS; DECISION PROBLEMS; EMPIRICAL STUDIES; EVOLUTION PROCESS; HIGH PROBABILITY; NEGATIVE INSTANCES; SATISFIABILITY; SEARCH ALGORITHMS;

ALGORITHMS; POLYNOMIAL APPROXIMATION;

ARTIFICIAL INTELLIGENCE;

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

References (10)

1. J. Franco and A. V. Gelder. A perspective on certain polynomial-time solvable classes of satisfiability. Discrete Applied Mathematics, 125(2-3):177-214, 2003.
2. I. Gent, H. Hoos, P. Prosser, and T. Walsh. Morphing: Combining structure and randomness. In Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI'99), pages 654-660, Orlando, Florida, 1999.
3. I. Gent. Arc consistency in SAT. In Proceedings of the 15th European Conference on Artificial Intelligence (ECAI 2002), pages 121-125, 2002.
4. C. Gomes and D. Shmoys. Completing quasigroups or latin squares: A structured graph coloring problem. In Proceedings of the Computational Symposium on Graph Coloring and Extensions, 2002.
5. C. Gomes, B. Selman, N. Crato, and H. Kautz. Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. Journal of Automated Reasoning, 24(1-2):67-100, 2000. (Pubitemid 30576096)
6. A. Hartmann and M. Weigt. Statistical mechanics of the vertex-cover problem. Journal of Physics A: Mathematical and General (a special issue), 36(43):11069-11093, 2003. (Pubitemid 37417210)
7. M. Krivelevich. Coloring random graphs - an algorithmic perspective. In Proceedings of the 2nd Colloquium on Mathematics and Computer Science (MathInfo'2002), pages 175-195. Birkhauser, 2002.
8. D. LeBerre and L. Simon. SAT competition - webpage, 2004. Available from: satlive.org/SATCompetition/2004.
9. n,m phase transition is not hard for the Hamiltonian Cycle problem. Journal of Artificial Intelligence Research, 9:219-245, 1998.
10. T. Walsh. Search in a small world. In Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99), pages 1172-1177, 1999.