Breaking instance-independent symmetries in exact graph coloring

Journal of Artificial Intelligence Research

Volumn 26, Issue , 2006, Pages 289-322

  Ramani, Arathi ^a   Markov, Igor L ^a   Sakallah, Karem A ^a   Aloul, Fadi A ^b  

^a UNIVERSITY OF MICHIGAN   (United States)

^b AMERICAN UNIVERSITY OF SHARJAH   (United Arab Emirates)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); GRAPH THEORY; HEURISTIC METHODS; OPERATIONS RESEARCH; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

BOOLEAN SATISFIABILITY; CODE OPTIMIZATION; GRAPH COLORING; SYMMETRY BREAKING PREDICATES (SBP);

STORAGE ALLOCATION (COMPUTER);

EID: 33749004831     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1637     Document Type: Article

References (54)

1. Aloul, F. A., Markov, I. L., & Sakallah, K. A. (2003). Shatter: Efficient symmetry-breaking for boolean satisfiability. In International Joint Conference on Artificial Intelligence, pp. 271-282.
2. Aloul, F. A., Markov, I. L., & Sakallah, K. A. (2004). MINCE: A static global variable-ordering heuristic for sat search and bdd manipulation. Journal of Universal Computer Science (JUGS), 10, 1562-1596.
3. Aloul, F. A., Ramani, A., Markov, I. L., & Sakallah, K. A. (2002). Generic ILP versus specialized 0-1 ILP: An update. In International Conference on Computer-Aided Design, pp. 450-457.
4. Aloul, F. A., Ramani, A., Markov, I. L., & Sakallah, K. A. (2003). Solving difficult instances of boolean satisfiability in the presence of symmetry. IEEE Transactions on CAD, 22, 1117-1137.
5. Aloul, F. A., Ramani, A., Markov, I. L., & Sakallah, K. A. (2004). Symmetry-breaking for pseudo-boolean formulas. In Asia-Pacific Design Automation Conference, pp. 884-887.
6. Aragon, C. R., Johnson, D. S., McGeoch, L. A., & Schevon, C. (1991). Optimization by simulated annealing: An experimental evaluation; part ii, graph coloring and number partitioning. Operations Research, 39, 378-406.
7. Benhamou, B. (2004). Symmetry in not-equals binary constraint networks. In Workshop on Symmetry in CSPs, pp. 2-8.
8. Brelaz, D. (1979). New methods to color vertices of a graph. Communications of the ACM, 22, 251-256.
9. Brown, R. J. (1972). Chromatic scheduling and the chromatic number problem. Management Science, 19, 451-463.
10. Cadoli, M., & Mancini, T. (2003). Detecting and breaking symmetries on specifications. In The Third Annual Workshop on Symmetry in Constraint Satisfaction Problems (SymCon), pp. 13-26.
11. Cadoli, M., Palopoli, L., Schaerf, A., & Vasileet, D. (1999). NP-SPEC: An executable specification language for solving all problems in NP. In Practical Aspects of Declarative Languages, pp. 16-30.
12. Chai, D., & Kuehlmann, A. (2003). A fast pseudo-boolean constraint solver. In Design Automation Conference, pp. 830-835.
13. Chaitin, G. J., Auslander, M., Chandra, A., Cocke, J., Hopkins, M., & Markstein, P. (1981). Register allocation via coloring. Computer Languages, 6, 47-57.
14. Chams, M., Hertz, A., & Werra, D. D. (1987). Some experiments with simulated annealing for coloring graphs. European Journal of Operations Research, 32, 260-266.
15. Coudert, O. (1997). Coloring of real-life graphs is easy. In Design Automation Conference, pp. 121-126.
16. Crawford, J. (1992). A theoretical analysis of reasoning by symmetry in first-order logic. In AAAI Workshop on Tractable Reasoning at the Tenth National Conference on Artificial Intelligence.
17. Crawford, J., Ginsberg, M., Luks, E., & Roy, A. (1996). Symmetry-breaking predicates for search problems. In 5th International Conference on Principles of Knowledge Representation and Reasoning, pp. 148-159.
18. Culberson, J. (2004). Graph coloring page. http://web.cs.ualberta.ca/~joe/Coloring/index.html.
19. Darga, P. T., Liffiton, M. H., Sakallah, K. A., & Markov, I. L. (2004). Exploiting structure in symmetry generation for cnf. In 41st Internation Design Automation Conference, pp. 530-534.
20. Davis, M., Logemann, G., & Loveland, D. (1962). A machine program for theorem proving. Communications of the ACM, 5, 394-397.
21. Fahle, T., Schamberger, S., & Sellmann, M. (2001). Symmetry breaking. In 7th International Conference on Principles and Practice of Constraint Programming, pp. 93-107.
22. Feige, U., Goldwasser, S., Lovasz, L., Safra, S., & Szege, M. (1991). Approximating clique is almost NP-complete. In IEEE Symposium on Foundations of Computer Science, pp. 2-12.
23. Focacci, F., & Milano, M. (2001). Global cut framework for removing symmetries. In Principles and Practice of Constraints Programming, pp. 77-82.
24. Galinier, P., & Hao, J. (1999). Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization, 3, 379-397.
25. Garey, M. R., & Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman and Company.
26. Gent, I. P. (2001). A symmetry-breaking constraint for indistinguishable values. In Workshop on Symmetry in Constraint Satisfaction Problems.
27. Goldberg, E., & Novikov, Y. (2002). Berkmin: A fast and robust SAT-solver. In Design Automation and Test in Europe, pp. 142-149.
28. Haldorsson, M. M. (1990). A still better performance guarantee for approximate graph coloring..
29. Hentenryck, P. V., Agren, M., Flener, P., & Pearson, J. (2003). Tractable symmetry breaking for CSPs with interchangeable values. In The International Joint Conference on Artificial Intelligence (IJCAI).
30. Hertz, A., & Werra, D. D. (1987). Using tabu search techniques for graph coloring. Computing, 39, 345-351.
31. Huang, J., & Darwiche, A. (2003). A structure-based variable ordering heuristic for SAT. In The International Joint Conference on Artificial Intelligence, pp. 1167-1172.
32. ILOG (2000). ILOG CPLEX ILP solver, version 7.0. http://www.ilog.com/products/cplex/.
33. J.-P. Hamiez, J.-K. H. (2001). Scatter search for graph coloring. In The 5th European Conference on Artificial Evolution, pp. 168-179.
34. Jagota, A. (1996). An adaptive, multiple restarts neural network algorithm for graph coloring. European Journal of Operational Research, 93, 257-270.
35. Kirovski, D., & Potkonjak, M. (1998). Efficient coloring of a large spectrum of graph. In Design Automation Conference.
36. Krishnamurthy, B. (1985). Short proofs for tricky formulas. Acta Informatica, 22, 327-337.
37. Kubale, M., & Jackowski, B. (1985). A generalized implicit enumeration algorithm for graph coloring. Communications of the ACM, 28, 412-418.
38. Kubale, M., & Kusz, E. (1983). Computational experience with implicit enumeration algorithms for graph coloring. In Proceedings of the WG'83 International Workshop on Graph Theoretic Concepts in Computer Science, pp. 167-176.
39. Leighton, F. (1979). A graph coloring algorithm for large scheduling problems. Journal of Research of the National Bureau of Standards, 84, 489-506.
40. McKay, B. D. (1990). Nauty user's guide (version 1.5). http://cs.anu.edu.au/~bdm/nauty/.
41. Mehrotra, A., & Trick, M. A. (1996). A column generation approach for graph coloring. INFORMS Journal on Computing, 8, 344-354.
42. Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., & Malik, S. (2001). Chaff: Engineering an efficient sat solver. In Design Automation Conference, pp. 530-535.
43. Mycielski, J. (1955). Sur le coloriage des graphs. Colloqium Mathematicum, 3, 161-162.
44. Prestwich, S. (2002). Supersymmetric modelling for local search. In SymCon: Workshop on Symmetries in CSPs, pp. 21-28.
45. Puget, J. (2002). Symmetry breaking revisited. In Principles and Practice of Constraints Programming, pp. 446-461.
46. Ramani, A., Aloul, F. A., Markov, I. L., & Sakallah, K. A. (2004). Breaking instance-independent symmetries in exact graph coloring. In Design Automation and Test in Europe, pp. 324-329.
47. Roney-Dougal, C. M., Gent, I. P., Kelsey, T., & Linton, S. (2004). Tractable symmetry breaking using restricted search trees. In European Conference on Artificial Intelligence, pp. 211-215.
48. Sheini, H. (2004). Pueblo 0-1 ILP solver. http://www.eecs.umich.edu/~hsheini/pueblo/.
49. Silva, J. P. M., & Sakallah, K. A. (1999). GRASP: A new search algorithm for satisfiability. IEEE Transactions On Computers, 48, 506-521.
50. Trick, M. (1996). Network resources for coloring a graph. http://mat.gsia.cmu.edu/COLOR/color.html.
51. Walsh, T. (2001). Search on high degree graphs. In 17th International Joint Conference on Artificial Intelligence, pp. 266-271.
52. Warners, J. P. (1998). A linear-time transformation of linear inequalities into conjunctive normal form. Information Processing Letters, 68, 63-69.
53. Welsh, D. J. A., & Powell, M. B. (1967). An upper bound on the chromatic number of a graph and its application to timetabling problems. Computer Journal, 10, 85-86.
54. Werra, D. D. (1985). An introduction to timetabling. European Journal of Operations Research, 19, 151-162.