liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Counting Homomorphisms via Hypergraph-based Structural Restrictions
Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology. (TCSLAB)
2012 (Swedish)Conference paper, Presentation (Refereed)
Abstract [en]

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
National Category
Computer and Information Science
URN: 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: diva2:543133
2nd International Symposium on Combinatorial Optimization (ISCO-2012), April 17-18, Athens
Available from: 2012-08-06 Created: 2012-08-06 Last updated: 2014-11-13

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Färnqvist, Tommy
By organisation
Software and SystemsThe Institute of Technology
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 33 hits
ReferencesLink to record
Permanent link

Direct link