Abstract
We study the fixed parameter tractability of the parameterized counting and decision version of the restrictive H-coloring problem. These problems are defined by fixing the number of preimages of a subset C of the vertices in H through a partial weight assignment (H,C,K). We consider two families of partial weight assignment the simple and the plain. For simple partial weight assignments we show an FPT algorithm for counting list (H,C,K)-colorings and faster algorithms for its decision version. For the more general class of plain partial weight assignment we give an FPT algorithm for the (H,C,K)-coloring decision problem. We introduce the concept of compactor and an algorithmic technique, compactor enumeration, that allow us to design the FPT algorithms for the counting version (and probably export the technique to other problems).
Partially supported by the EU within FP6 under contract 001907 (DELIS). The first author was further supported by the Distinció per a la Recerca of the Generalitat de Catalunya. The second and third authors were further supported by the Spanish CICYT project TIC-2002-04498-C05-03.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Díaz, J.: H-colorings of graphs. Bulletin of the European Association for Theoretical Computer Science (75), 82–92 (2001)
Díaz, J., Serna, M., Thilikos, D. (H,C,K)-coloring: Fast, easy and hard cases. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 304–315. Springer, Heidelberg (2001)
Díaz, J., Serna, M., Thilikos, D.: The restrictive H-coloring problem. Discrete Applied Mathematics (to appear)
Díaz, J., Serna, M., Thilikos, D.M.: Recent results on parameterized H-colorings Graphs. In: Morphisms and Statistical Physics. DIMACS series in Discrete Mathematics and Theoretical Computer Science, vol. 63, pp. 65–85 (2004)
Díaz, J., Serna, M., Thilikos, D.M.: Complexity issues on Bounded Restrictive H-colorings (2004) (submitted)
Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer, New York (1999)
Dyer, M., Greenhill, C.: The complexity of counting graph homomorphisms. Random Structures Algorithms 17, 260–289 (2000)
Feder, T., Hell, P.: List homomorphisms to reflexive graphs. Journal of Combinatorial Theory (series B) 72(2), 236–250 (1998)
Feder, T., Hell, P., Huang, J.: List homomorphisms and circular arc graphs. Combinatorica 19, 487–505 (1999)
Flum, J., Grohe, M.: The parameterized complexity of counting problems. SIAM Journal on Computing 33(4), 892–922 (2004)
Gabow, H., Tarjan, R.: Faster scaling algorithms for network problems. SIAM Journal on Computing 18, 1013–1036 (1989)
Hell, P., Nešetřil, J.: On the complexity of H-coloring. Journal of Combinatorial Theory (series B) 48, 92–110 (1990)
Hell, P., Nešetřil, J.: Counting list homomorphisms and graphs with bounded degrees. In: Graphs, Morphisms and Statistical Physics. DIMACS series in Discrete Mathematics and Theoretical Computer Science, vol. 63, pp. 105–112 (2004)
McCartin, C.: Parameterized counting problems. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol. 2420, pp. 556–567. Springer, Heidelberg (2002)
McCartin, C.: Contributions to Parameterized Complexity. PhD thesis, Victoria University of Wellington (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Díaz, J., Serna, M., Thilikos, D.M. (2004). Fixed Parameter Algorithms for Counting and Deciding Bounded Restrictive List H-Colorings. In: Albers, S., Radzik, T. (eds) Algorithms – ESA 2004. ESA 2004. Lecture Notes in Computer Science, vol 3221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30140-0_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-30140-0_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23025-0
Online ISBN: 978-3-540-30140-0
eBook Packages: Springer Book Archive