Affiliation:
1. Institut polytechnique de Paris, T´el´ecom Paris, 91123 Palaiseau, FRANCE
2. Laboratoire Interdisciplinaire des Sciences du Num´erique (UMR 9015), CNRS, Universit´e Paris-Saclay, 91400 Orsay, FRANCE
Abstract
For some well-known N P-complete problems, linked to the colourability of a graph, we study the variation which consists in asking about the uniqueness of a solution (up to permutations of the colours). In particular, we show that the decision problems Unique k-Colouring (U-k-COL) with k > 3 and Unique Colouring (U-COL), have equivalent complexities, up to polynomials, as Unique Satisfiability (U-SAT) and Unique Onein-Three Satisfiability (U-1-3-SAT) by establishing polynomial reductions relating these four problems. As a consequence, all are co-N P-hard (or, equivalently, N P-hard with respect to Turing reductions) and belong to the complexity class DP. We also consider the problem Unique Optimal Colouring (U-OCOL) and show that it belongs to L N P (also denoted Θ2).
Publisher
World Scientific and Engineering Academy and Society (WSEAS)
Reference28 articles.
1. J.-P. BARTHELEMY, G. D. COHEN and ´ A. C. LOBSTEIN: Algorithmic Complexity and Communication Problems, University College of London: London, 1996.
2. C. BERGE: Graphes, Gauthier-Villars: Paris, 1983. English translation: Graphs, NorthHolland Publishing Co.: Amsterdam, 1985.
3. A. BLASS and Y. GUREVICH: On the unique satisfiability problem, Information and Control, Vol. 55, pp. 80-88, 1982.
4. M. BLIDIA, M. CHELLALI, R. LOUNES and F. MAFFRAY: Characterizations of trees with unique minimum locating-dominating sets, Journal of Combinatorial Mathematics and Combinatorial Computing, Vol. 76, pp. 225– 232, 2011.
5. C. CALABRO, R. IMPAGLIAZZO, V. KABANETS and R. PATURI: The complexity of Unique k-SAT: an isolation lemma for kCNFs, Journal of Computer and System Sciences, Vol. 74, pp. 386–393, 2008.