Mostra el registre d'ítem simple
Efficient algorithms for parameterized H-colorings
dc.contributor.author | Díaz Cort, Josep |
dc.contributor.author | Serna Iglesias, María José |
dc.contributor.author | Thilikos Touloupas, Dimitrios |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics |
dc.date.accessioned | 2016-04-18T14:23:15Z |
dc.date.available | 2016-04-18T14:23:15Z |
dc.date.issued | 2005-12 |
dc.identifier.citation | Díaz, J., Serna, M., Thilikos, D. "Efficient algorithms for parameterized H-colorings". 2005. |
dc.identifier.uri | http://hdl.handle.net/2117/85812 |
dc.description.abstract | We 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.extent | 28 p. |
dc.language.iso | eng |
dc.relation.ispartofseries | LSI-05-61-R |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
dc.subject.other | Parameterized list H-colorings |
dc.subject.other | Fixed parameter tractability |
dc.subject.other | Fixed parameter algorithms |
dc.title | Efficient algorithms for parameterized H-colorings |
dc.type | External research report |
dc.rights.access | Open Access |
local.identifier.drac | 515245 |
dc.description.version | Postprint (published version) |
local.citation.author | Díaz, J.; Serna, M.; Thilikos, D. |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Reports de recerca [1.107]