Show simple item record

dc.contributor.authorDíaz Cort, Josep
dc.contributor.authorSerna Iglesias, María José
dc.contributor.authorThilikos Touloupas, Dimitrios
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
dc.identifier.citationDíaz, J., Serna, M., Thilikos, D. "Efficient algorithms for parameterized H-colorings". 2005.
dc.description.abstractWe study the fixed parameter tractability of the restrictive $H$-coloring and the restrictive list $H$-coloring problems, introduced in~cite{DST01b}. The parameterizations are defined by fixing the number of pre-images of a subset $C$ of the vertices in $H$ through a partial weight assignment $(C,K)$. We define two families of partially weighted graphs: the emph{simple} and the emph{plain}. For the class of simple partially weighted graphs, we show the fixed parameter tractability of the list $(H,C,K)$-coloring problem. For the more general class of plain partially weighted graphs, we prove the fixed parameter tractability of the $(H,C,K)$-coloring problem.
dc.format.extent28 p.
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.otherParameterized list H-colorings
dc.subject.otherFixed parameter tractability
dc.subject.otherFixed parameter algorithms
dc.titleEfficient algorithms for parameterized H-colorings
dc.typeExternal research report
dc.rights.accessOpen Access
dc.description.versionPostprint (published version)
upcommons.citation.authorDíaz, J.; Serna, M.; Thilikos, D.

Files in this item


This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder