Complexity issues on bounded restrictive H-coloring

dc.contributor.author	Serna Iglesias, María José
dc.contributor.author	Díaz Cort, Josep
dc.contributor.author	Thilikos Touloupas, Dimitrios
dc.contributor.other	Universitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned	2016-12-19T14:03:42Z
dc.date.available	2016-12-19T14:03:42Z
dc.date.issued	2004-04
dc.identifier.citation	Serna, M., Diaz, J., Thilikos, D. "Complexity issues on bounded restrictive H-coloring". 2004.
dc.identifier.uri	http://hdl.handle.net/2117/98585
dc.description.abstract	We consider the restriction of the H-coloring problem where we are looking for homomorphisms were the number of preimages of certain vertices of H is bounded by some fixed constant. We consider the decision and the counting version of the problem and further variations. We provide complexity results identifying the cases when the problem belongs to the class P or it is NP-complete or #P-complete.
dc.format.extent	16 p.
dc.language.iso	eng
dc.relation.ispartofseries	R04-22
dc.subject	Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.other	H-coloring
dc.title	Complexity issues on bounded restrictive H-coloring
dc.type	External research report
dc.rights.access	Open Access
local.identifier.drac	515222
dc.description.version	Postprint (published version)
local.citation.author	Serna, M.; Diaz, J.; Thilikos, D.

UPCommons. Portal del coneixement obert de la UPC