Another look at graph coloring via propositional satisfiability

Discrete Applied Mathematics

Volumn 156, Issue 2, 2008, Pages 230-243

  Van Gelder, Allen ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Constraint satisfaction; Graph coloring; Independent set analysis; Propositional satisfiability; Symmetry breaking

Indexed keywords

CONSTRAINT THEORY; NUMERICAL METHODS; PROBLEM SOLVING; RANDOM PROCESSES;

CHROMATIC NUMBERS; CONSTRAINT SATISFACTION; GRAPH COLORING; INDEPENDENT SET ANALYSIS; PROPOSITIONAL SATISFIABILITY; SYMMETRY BREAKING;

GRAPH THEORY;

EID: 37149019503     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2006.07.016     Document Type: Article

References (26)

1. Bacchus F. Exploring the computational tradeoff of more reasoning and less searching. Symposium on the Theory and Applications of Satisfiability Testing (2002), Cincinnati, OH 7-16
2. Bayardo Jr. R.J., and Schrag R.C. Using CSP look-back techniques to solve real-world SAT instances. Proceedings Fourteenth National Conference on Artificial Intelligence (AAAI-97) (1997) 203-208
3. Billionnet A., and Sutter A. An efficient algorithm for the 3-satisfiability problem. Oper. Res. Lett. 12 (1992) 29-36
4. Culberson J., and Gent I. Frozen development in graph coloring. Theoret. Comput. Sci. 265 1-2 (2001) 227-264. http://www.cs.ualberta.ca/~joe/Coloring/ smallk source available at URL 〈http://www.cs.ualberta.ca/∼joe/Coloring/〉
5. Davis M., Logemann G., and Loveland D. A machine program for theorem-proving. Comm. ACM 5 (1962) 394-397
6. Hertz A., and de Werra D. Using tabu search techniques for graph coloring. Computing 39 4 (1987) 345-351
7. S. Hossain, T. Steihaug, Graph coloring in the estimation of sparse derivative matrices: instances and applications, Discrete. Appl. Math., doi:10.1016/j.dam.2006.07.018.
8. Johnson D.S., Aragon C.R., McGeoch L.A., and Schevon C. Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning. Oper. Res. 39 3 (1991) 378-406
9. A. Johri, D.W. Matula, Probabilistic bounds and heuristic algorithms for coloring large random graphs, Technical Report 82-CSE-06, Department of Computer Science and Engineering, Southern Methodist University, Dallas, Texas, 75275, June 1982.
10. D. LeBerre, et al. SAT 2005 Competition First Stage Results, URL 〈http://www.satcompetition.org/2005/firststage.html〉, 2005.
11. Leighton F.T. A graph colouring algorithm for large scheduling problems. J. Res. Nat. Bur. Standards 84 6 (1979) 489-503
12. Letz R., Mayr K., and Goller C. Controlled integration of the cut rule into connection tableau calculi. J. Automat. Reason. 13 3 (1994) 297-337
13. Lewandowski G., and Condon A. Experiments with parallel graph coloring heuristics and applications of graph coloring. In: Johnson D.S., and Trick M.A. (Eds). Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, 1993, DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 26 (1996), American Mathematical Society, Providence, NI 309-334
14. Li C.M. Integrating equivalency reasoning into Davis-Putnam procedure. AAAI (2000)
15. Loveland D.W. A simplified format for the model elimination theorem-proving procedure. J. Assoc. Comput. Mach. 16 3 (1969) 349-363
16. Minker J., and Zanon G. An extension to linear resolution with selection function. Inform. Process. Lett. 14 3 (1982) 191-194
17. Morgenstern C. Distributed coloration neighborhood search. In: Johnson D.S., and Trick M.A. (Eds). Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, 1993, DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 26 (1996), American Mathematical Society, Providence, RI 335-357
18. Moskewicz M., Madigan C., Zhao Y., Zhang L., and Malik S. Chaff: engineering an efficient SAT solver. 39th Design Automation Conference (June 2001)
19. Pretolani D. Efficiency and stability of hypergraph SAT algorithms. In: Johnson D.S., and Trick M. (Eds). Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science (1995), American Mathematical Society, Providence, RI
20. Silva J.P., and Sakallah K.A. GRASP-a new search algorithm for satisfiability. Proceedings of IEEE/ACM International Conference on Computer-Aided Design (1996), IEEE Computer Society Press, Silver Spring, MD
21. M.A. Trick (Ed.), Computational Symposium on Graph Coloring and its Generalizations (COLOR02). Ithaca, NY, 2002, URL 〈http://mat.gsia.cmu.edu/COLOR02〉.
22. Van Gelder A. Autarky pruning in propositional model elimination reduces failure redundancy. J. Automat. Reasoning 23 2 (1999) 137-193
23. Van Gelder A. Extracting (easily) checkable proofs from a satisfiability solver that employs both preorder and postorder resolution. Seventh International Symposium on AI and Mathematics (2002), Ft. Lauderdale, FL
24. Van Gelder A., and Tsuji Y.K. Satisfiability testing with more reasoning and less guessing. In: Johnson D.S., and Trick M. (Eds). Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science (1996), American Mathematical Society, Providence, RI
25. Zhang H. SATO: an efficient propositional prover. 14th International Conference on Automated Deduction (1997) 272-275
26. Zhang L., Madigan C., Moskewicz M., and Malik S. Efficient conflict driven learning in a Boolean satisfiability solver. ICCAD (November 2001)