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 Ciències de la Computació
dc.identifier.citationDiaz, J., Serna, M., Thilikos, D. "Counting H-colorings of partial k-trees". 2000.
dc.description.abstractThe 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.extent19 p.
dc.subjectÀrees temàtiques de la UPC::Informàtica
dc.titleCounting H-colorings of partial k-trees
dc.typeExternal research report
dc.rights.accessOpen Access
dc.description.versionPostprint (published version)
upcommons.citation.authorDiaz, 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