Abstract
In the List Coloring problem, the input is a graph G and list of colors \(L:V(G)\rightarrow {\mathbb N}\) for each vertex \(v\in V(G)\). The objective is to test the existence of a coloring \(\lambda :V(G)\rightarrow {\mathbb N}\) such that for each \(v\in V(G)\), \(\lambda (v)\in L(v)\) and for each edge \((u,v)\in E(G)\), \(\lambda (u)\ne \lambda (v)\). Fiala et al. (TCS 2011) proved that List Coloring is W[1]-hard when parameterized by the vertex cover number of the input graph. Recently, Gutin et al. (STACS 2020, SIDMA 2021) designed an \(O^*(2^k)\) time randomized algorithm for List Coloring where k is the size of the given clique modulator of the input graph. Since List Coloring is W[1]-hard parameterized by the vertex cover number, List Coloring is W[1]-hard parameterized by the size of a cluster modulator. In this work we study the problem parameteized by the size of \(\ell \)-cluster modulator. That is, along with the input we are also given a vertex subset D such that \(G-D\) is cluster graph with \(\ell \) connected components. We prove that assuming Exponential Time Hypothesis (ETH), List Coloring can not be solved in time \(f(|D|+\ell )n^{o(\frac{|D|+\ell }{\log {|D|+\ell }})}\) for any computable function f.
In the Max Coloring problem, we are given a graph G and a weight function \(w :V(G) \rightarrow {\mathbb N}\). For a proper coloring \(\lambda \), the cost of \(\lambda \) is defined as follows. For each color i, w(i) is the maximum weight of a vertex colored i. Then, the cost of \(\lambda \) is \(\sum _{i\in C} w(i)\), where \(C=\{ \lambda (v) ~|~v\in V(G)\}\). In the Max Coloring problem, our objective is to find a proper coloring with minimum cost. Araújo et al. (TCS 2018) proved that Max Coloring is W[1]-hard even on forests when parameterized by the size of the largest connected component in the input forest. Here, we prove that Max Coloring is FPT with respect to parameters (i) the size of a vertex cover, (ii) the size of a clique modulator, and (iii) the size of a 2-cluster modulator.
Keywords
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 subscriptionsNotes
- 1.
Throughout the paper, we use [q] to denote the set \(\{1,2,\ldots ,q\}\).
- 2.
\(O^*\) notation hides polynomial factor in the input size.
- 3.
For a function \(f:X \rightarrow Y\) and \(y\in Y\), \(f^{-1}(y)\) denotes the set \(\{x ~|~ f(x)=y\}\).
References
Adleman, L.M., Jr., H.W.L.: Finding irreducible polynomials over finite fields. In: Hartmanis, J. (ed.) Proceedings of the 18th Annual ACM Symposium on Theory of Computing, Berkeley, California, USA, 28–30 May 1986, pp. 350–355. ACM (1986). https://doi.org/10.1145/12130.12166
Araújo, J., Baste, J., Sau, I.: Ruling out FPT algorithms for weighted coloring on forests. Theor. Comput. Sci. 729, 11–19 (2018). https://doi.org/10.1016/j.tcs.2018.03.013
Araújo, J., Nisse, N., Pérennes, S.: Weighted coloring in trees. SIAM J. Discret. Math. 28(4), 2029–2041 (2014). https://doi.org/10.1137/140954167
Bannach, M., et al.: Solving packing problems with few small items using rainbow matchings. arXiv abs/2007.02660 (2020)
Dailey, D.P.: Uniqueness of colorability and colorability of planar 4-regular graphs are np-complete. Discret. Math. 30(3), 289–293 (1980). https://doi.org/10.1016/0012-365X(80)90236-8. https://www.sciencedirect.com/science/article/pii/0012365X80902368
Demange, M., Werra, D., Monnot, J., Paschos, V.T.: Weighted node coloring: when stable sets are expensive. In: Goos, G., Hartmanis, J., van Leeuwen, J., Kučera, L. (eds.) WG 2002. LNCS, vol. 2573, pp. 114–125. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-36379-3_11
DeMillo, R.A., Lipton, R.J.: A probabilistic remark on algebraic program testing. Inf. Process. Lett. 7(4), 193–195 (1978). https://doi.org/10.1016/0020-0190(78)90067-4
Escoffier, B.: Saving colors and max coloring: some fixed-parameter tractability results. Theor. Comput. Sci. 758, 30–41 (2019). https://doi.org/10.1016/j.tcs.2018.08.002
Escoffier, B., Monnot, J., Paschos, V.T.: Weighted coloring: further complexity and approximability results. Inf. Process. Lett. 97(3), 98–103 (2006). https://doi.org/10.1016/j.ipl.2005.09.013
Fiala, J., Golovach, P.A., Kratochvíl, J.: Parameterized complexity of coloring problems: treewidth versus vertex cover. Theor. Comput. Sci. 412(23), 2513–2523 (2011). https://doi.org/10.1016/j.tcs.2010.10.043
Gutin, G., Wahlström, M., Yeo, A.: Rural postman parameterized by the number of components of required edges. J. Comput. Syst. Sci. 83(1), 121–131 (2017). https://doi.org/10.1016/j.jcss.2016.06.001. https://www.sciencedirect.com/science/article/pii/S0022000016300411
Gutin, G.Z., Majumdar, D., Ordyniak, S., Wahlström, M.: Parameterized pre-coloring extension and list coloring problems. SIAM J. Discret. Math. 35(1), 575–596 (2021). https://doi.org/10.1137/20M1323369
Impagliazzo, R., Paturi, R.: Complexity of k-SAT. In: Proceedings of Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No. 99CB36317), pp. 237–240 (1999). https://doi.org/10.1109/CCC.1999.766282
Marx, D.: Can you beat treewidth? Theory Comput. 6(1), 85–112 (2010). https://doi.org/10.4086/toc.2010.v006a005
Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27(4), 701–717 (1980). https://doi.org/10.1145/322217.322225
Wahlström, M.: Abusing the tutte matrix: an algebraic instance compression for the k-set-cycle problem. In: Portier, N., Wilke, T. (eds.) 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, Kiel, Germany, 27 February–2 March 2013. LIPIcs, vol. 20, pp. 341–352. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013). https://doi.org/10.4230/LIPIcs.STACS.2013.341
de Werra, D., Demange, M., Escoffier, B., Monnot, J., Paschos, V.T.: Weighted coloring on planar, bipartite and split graphs: complexity and approximation. Discret. Appl. Math. 157(4), 819–832 (2009). https://doi.org/10.1016/j.dam.2008.06.013
Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Ng, E.W. (ed.) Symbolic and Algebraic Computation. LNCS, vol. 72, pp. 216–226. Springer, Heidelberg (1979). https://doi.org/10.1007/3-540-09519-5_73
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this paper
Cite this paper
Aryanfard, B., Panolan, F. (2022). Parameterized Complexity of List Coloring and Max Coloring. In: Kulikov, A.S., Raskhodnikova, S. (eds) Computer Science – Theory and Applications. CSR 2022. Lecture Notes in Computer Science, vol 13296. Springer, Cham. https://doi.org/10.1007/978-3-031-09574-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-031-09574-0_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-09573-3
Online ISBN: 978-3-031-09574-0
eBook Packages: Computer ScienceComputer Science (R0)