Skip to main content
SpringerLink
Log in

Counting Homomorphisms via Hypergraph-Based Structural Restrictions

  • Conference paper
Combinatorial Optimization (ISCO 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7422))

Included in the following conference series:

  • 2029 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abrahamson, K.A., Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogs. Annals of Pure and Applied Logic 73(3), 235–276 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  2. Adler, I., Gottlob, G., Grohe, M.: Hypertree width and related hypergraph invariants. European Journal of Combinatorics 28, 2167–2181 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  3. Atserias, A., Grohe, M., Marx, D.: Size bounds and query plans for relational joins. In: 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2008), pp. 739–748 (2008)

    Google Scholar 

  4. Chen, H., Grohe, M.: Constraint satisfaction with succinctly specified relations. Journal of Computer and System Sciences 76(8), 847–860 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  5. Chung, F.R., Graham, R.L., Frankl, P., Shearer, J.B.: Some intersection theorems for ordered sets and graphs. Journal of Combinatorial Theory Series A 43, 23–37 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  6. Dalmau, V., Jonsson, P.: The complexity of counting homomorphisms seen from the other side. Theoretical Computer Science 329(1-3), 315–323 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  7. Dechter, R.: Constraint Processing. Morgan Kaufmann (2003)

    Google Scholar 

  8. Fagin, R.: Degrees of acyclicity for hypergraphs and relational database schemes. Journal of the ACM 30, 514–550 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  9. Feder, T., Vardi, M.Y.: The computational structure of monotone monadic SNP and constraint satisfaction: a study through datalog and group theory. SIAM Journal on Computing 28(1), 57–104 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  10. Flum, J., Grohe, M.: The parameterized complexity of counting problems. In: Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science, pp. 528–547 (2002)

    Google Scholar 

  11. Gottlob, G., Leone, N., Scarcello, F.: Hypertree decompositions and tractable queries. Journal of Computer and System Sciences 64(3), 579–627 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  12. Gottlob, G., Miklós, Z., Schwentick, T.: Generalized hypertree decompositions: NP-hardness and tractable variants. Journal of the ACM 56, 1–30 (2009)

    Article  MathSciNet  Google Scholar 

  13. Grohe, M., Marx, D.: Constraint solving via fractional edge covers. In: Proceedings of the seventeenth annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), pp. 289–298 (2006)

    Google Scholar 

  14. Hell, P., Nes̆etr̆il, J.: Graphs and homomorphisms. Oxford Lecture Series in Mathematics and Its Applications, vol. 28. Oxford University Press (2004)

    Google Scholar 

  15. Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? Journal of Computer and System Sciences 63(4), 512–530 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  16. Kolaitis, P.G., Vardi, M.: Conjunctive-query containment and constraint satisfaction. Journal of Computer and System Sciences 61(2), 302–332 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  17. Marx, D.: Approximating fractional hypertree width. ACM Transactions on Algorithms 6, 1–17 (2010)

    Article  MathSciNet  Google Scholar 

  18. Marx, D.: Tractable hypergraph properties for constraint satisfaction and conjunctive queries. In: Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC 2010), pp. 735–744 (2010)

    Google Scholar 

  19. Marx, D.: Tractable structures for constraint satisfaction with truth tables. Theory of Computing Systems 48, 444–464 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  20. Pesant, G.: Counting solutions of CSPs: A structural approach. In: Proceedings of the 19th International Joint Conference on Artificial intelligence (IJCAI 2005), pp. 260–265 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Science, Linköping University, SE-581 83, Linköping, Sweden

    Tommy Färnqvist

Authors
  1. Tommy Färnqvist
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LAMSADE, Université Paris-Dauphine, Place du Maréchal de Lattre de Tassigny, 75775, Paris Cedex 16, France

    A. Ridha Mahjoub  & Vangelis Th. Paschos  & 

  2. Department of Informatics, Athens University of Economics and Business, 76 Patission str., 10434, Athens, Greece

    Vangelis Markakis  & Ioannis Milis  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Färnqvist, T. (2012). Counting Homomorphisms via Hypergraph-Based Structural Restrictions. In: Mahjoub, A.R., Markakis, V., Milis, I., Paschos, V.T. (eds) Combinatorial Optimization. ISCO 2012. Lecture Notes in Computer Science, vol 7422. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32147-4_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32147-4_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32146-7

  • Online ISBN: 978-3-642-32147-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation