Counting Homomorphisms via Hypergraph-based Structural Restrictions
2012 (Swedish)Conference paper, Presentation (Refereed)
The way in which the graph structure of the constraints influences the computational complexity of counting constraint satisfaction problems (#CSPs) is well understood for constraints of bounded arity. The situation is less clear if there is no bound on the arities. Here we initiate the systematic study of these problems and identify new classes of polynomial time solvable instances based on dynamic programming over tree decompositions, in a way generalizing well-known approaches to combinatorial optimization problems on bounded treewidth graphs, but basing the decompositions on various hypergraph width measures from the literature on plain CSPs.
Place, publisher, year, edition, pages
Springer Berlin Heidelberg , 2012. 380-391 p.
Lecture Notes in Computer Science, ISSN 0302-9743 (print), 1611-3349 (online) ; 7422
Computer and Information Science
IdentifiersURN: urn:nbn:se:liu:diva-79502DOI: 10.1007/978-3-642-32147-4_34ISBN: 978-3-642-32146-7 (print)ISBN: 978-3-642-32147-4 (online)OAI: oai:DiVA.org:liu-79502DiVA: diva2:543133
2nd International Symposium on Combinatorial Optimization (ISCO-2012), April 17-18, Athens