Mostra el registre d'ítem simple
Counting H-colorings of partial k-trees
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 Ciències de la Computació |
dc.date.accessioned | 2016-11-30T18:30:41Z |
dc.date.available | 2016-11-30T18:30:41Z |
dc.date.issued | 2000-11 |
dc.identifier.citation | Diaz, J., Serna, M., Thilikos, D. "Counting H-colorings of partial k-trees". 2000. |
dc.identifier.uri | http://hdl.handle.net/2117/97570 |
dc.description.abstract | The problem of counting all H-colorings of a graph G of n vertices is considered. While the problem is, in general #P-complete, we give linear time algorithms that solve the main variants of this problem when the input graph G is a k-tree or, in the case where G is directed, when the underlying graph of G is a k-tree. Our algorithms remain polynomial even in the case where k=O(log n) or in the case where the size of H is O(n). Our results are easy to implement and imply the existence of polynomial time algorithms for a series of problems on partial k-trees such as core checking and chromatic polynomial computation. |
dc.format.extent | 19 p. |
dc.language.iso | eng |
dc.relation.ispartofseries | LSI-00-76-R |
dc.subject | Àrees temàtiques de la UPC::Informàtica |
dc.subject.other | H-colorings |
dc.subject.other | k-trees |
dc.title | Counting H-colorings of partial k-trees |
dc.type | External research report |
dc.rights.access | Open Access |
local.identifier.drac | 515139 |
dc.description.version | Postprint (published version) |
local.citation.author | Diaz, J.; Serna, M.; Thilikos, D. |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Reports de recerca [1.107]