Complexity issues on bounded restrictive H-coloring |
| |
| Authors: | Josep Dí az,Dimitrios M. Thilikos |
| |
| Affiliation: | ALBCOM Research Group, Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Campus Nord, Edifici Ω, Jordi Girona Salgado 1-3, 08034 Barcelona, Spain |
| |
| Abstract: | We consider a bounded version of the restrictive and the restrictive list H-coloring problem in which the number of pre-images of certain vertices of H is taken as parameter. We consider the decision and the counting versions, as well as, further variations of those problems. We provide complexity results identifying the cases when the problems are NP-complete or #P-complete or polynomial time solvable. We conclude stating some open problems. |
| |
| Keywords: | Restrictive H-coloring Restrictive list H-coloring Parameterization Counting problems sansserif" >NP-complete #P-complete |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
