Counting Homomorphisms via Hypergraph-Based Structural Restrictions

DOI10.1007/978-3-642-32147-4_34zbMATH Open1370.68123OpenAlexW1637248844MaRDI QIDQ3167641

Tommy Färnqvist

Publication date: 2 November 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32147-4_34

zbMATH Keywords

computational complexityhypergraphcountinghomomorphismconstraint satisfaction

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65)

Related Items (1)

On counting homomorphisms to directed acyclic graphs

This page was built for publication: Counting Homomorphisms via Hypergraph-Based Structural Restrictions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3167641)