Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Angelsmark, O.: Constructing Algorithms for Constraint Satisfaction and Related Problems. PhD thesis, Department of Computer and Information Science, Linköpings Universitet, Sweden (2005)
Angelsmark, O., Jonsson, P.: Improved Algorithms for Counting Solutions in Constraint Satisfaction Problems. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 81–95. Springer, Heidelberg (2003)
Angelsmark, O., Jonsson, P., Thapper, J.: Two methods for constructing new CSP algorithms from old. Unpublished manuscript (2004)
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)
Byskov, J.M.: Enumerating maximal independent sets with applications to graph colouring. Operations Research Letters 32(6), 547–556 (2004)
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)
Byskov, J.M., Eppstein, D.: An algorithm for enumerating maximal bipartite subgraphs. Unpublished manuscript (see also [6]) (2004)
Chaitin, G.J., Auslander, M.A., Chandra, A.K., Cocke, J., Hopkins, M.E., Markstein, P.W.: Register allocation via coloring. Computer Languages 6, 47–57 (1981)
Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation 9(3), 251–280 (1990)
Dahllöf, V., Jonsson, P., Wahlström, M.: Counting models for 2SAT and 3SAT formulae. Theoretical Computer Science 332(1–3), 265–291 (2005)
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)
Eppstein, D.: Small maximal independent sets and faster exact graph coloring. Journal of Graph Algorithms and Applications 7(2), 131–140 (2003)
Feder, T., Motwani, R.: Worst-case time bounds for coloring and satisfiability problems. Journal of Algorithms 45(2), 192–201 (2002)
Gamst, A.: Some lower bounds for a class of frequency assignment problems. IEEE Transactions on Vehicular Technology 35(1), 8–14 (1986)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)
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)
Jonsson, P., Liberatore, P.: On the complexity of finding satisfiable subinstances in constraint satisfaction. Technical Report TR99-038, Electronic Colloquium on Computational Complexity (1999)
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)
Kullmann, O.: New methods for 3-SAT decision and worst-case analysis. Theoretical Computer Science 223(1–2), 1–72 (1999)
Lawler, E.L.: A note on the complexity of the chromatic number problem. Information Processing Letters 5(3), 66–67 (1976)
Robson, M.: Finding a maximum independent set in time O(2n/4). Technical report, LaBRI, Université Bordeaux I (2001)
Williams, R.: A New Algorithm for Optimal Constraint Satisfaction and Its Implications. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 1227–1237. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Angelsmark, O., Thapper, J. (2006). Partitioning Based Algorithms for Some Colouring Problems. In: Hnich, B., Carlsson, M., Fages, F., Rossi, F. (eds) Recent Advances in Constraints. CSCLP 2005. Lecture Notes in Computer Science(), vol 3978. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11754602_4
Download citation
DOI: https://doi.org/10.1007/11754602_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34215-1
Online ISBN: 978-3-540-34216-8
eBook Packages: Computer ScienceComputer Science (R0)