Partitioning Based Algorithms for Some Colouring Problems
We discuss four variants of the graph colouring problem, and empresent algorithms for solving them. The problems are k -Colourability, Max Ind k -COL, Max Val k -COL, and, finally, Max k -COL, which is the unweighted case of the Max k -Cut problem. The algorithms are based on the idea of partitioning the domain of the problems into disjoint subsets, and then considering all possible instances were the variables are restricted to values from these partitions. If a pair of variables have been restricted to different partitions, then the constraint between them is always satisfied since the only allowed constraint is disequality.
KeywordsDomain Size Chromatic Number Colouring Problem Register Allocation Graph Colouring Problem
Unable to display preview. Download preview PDF.
- 1.Angelsmark, O.: Constructing Algorithms for Constraint Satisfaction and Related Problems. PhD thesis, Department of Computer and Information Science, Linköpings Universitet, Sweden (2005)Google Scholar
- 3.Angelsmark, O., Jonsson, P., Thapper, J.: Two methods for constructing new CSP algorithms from old. Unpublished manuscript (2004)Google Scholar
- 4.Angelsmark, O., Thapper, J.: A microstructure based approach to constraint satisfaction optimisation problems. In: Russell, I., Markov, Z. (eds.) Recent Advances in Artificial Intelligience. Proceedings of the Eighteenth International Florida Artificial Intelligence Research Society Conference (FLAIRS-2005), Clearwater Beach, Florida, USA, May 15-17, 2005, pp. 155–160. AAAI Press, Menlo Park (2005)Google Scholar
- 6.Byskov, J.M.: Exact Algorithms for Graph Colouring and Exact Satisfiability. PhD thesis, Basic Research In Computer Science (BRICS), Department of Computer Science, University of Aarhus, Denmark (August 2004)Google Scholar
- 7.Byskov, J.M., Eppstein, D.: An algorithm for enumerating maximal bipartite subgraphs. Unpublished manuscript (see also ) (2004)Google Scholar
- 11.Eppstein, D.: Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. In: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-2001), Washington, DC, USA, January 7-9, 2001, pp. 329–337. ACM/SIAM (2001)Google Scholar
- 16.Jégou, P.: Decomposition of domains based on the micro-structure of finite constraint-satisfaction problems. In: Proceedings of the 11th (US) National Conference on Artificial Intelligence (AAAI-1993), Washington DC, USA, July 1993, pp. 731–736. American Association for Artificial Intelligence (AAAI), Menlo Park (1993)Google Scholar
- 17.Jonsson, P., Liberatore, P.: On the complexity of finding satisfiable subinstances in constraint satisfaction. Technical Report TR99-038, Electronic Colloquium on Computational Complexity (1999)Google Scholar
- 18.Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press (1972)Google Scholar
- 21.Robson, M.: Finding a maximum independent set in time O(2n/4). Technical report, LaBRI, Université Bordeaux I (2001)Google Scholar