Counting Homomorphisms to Square-Free Graphs, Modulo 2
We study the problem ⊕HomsTo<em>H</em> of counting, modulo 2, the homomorphisms from an input graph to a fixed undirected graph <em>H</em>. A characteristic feature of modular counting is that cancellations make wider classes of instances tractable than is the case for exact...
Prif Awduron: | Gobel, A, Goldberg, L, Richerby, D |
---|---|
Fformat: | Conference item |
Iaith: | English |
Cyhoeddwyd: |
Schloss Dagstuhl - LZI GmbH
2015
|
Eitemau Tebyg
-
Counting homomorphisms to square-free graphs, modulo 2
gan: Goldberg, L, et al.
Cyhoeddwyd: (2016) -
The Complexity of Counting Homomorphisms to Cactus Graphs Modulo 2
gan: Göbel, A, et al.
Cyhoeddwyd: (2013) -
Counting homomorphisms to K4-minor-free graphs, modulo 2
gan: Focke, J, et al.
Cyhoeddwyd: (2021) -
Counting homomorphisms to K4-minor-free graphs, modulo 2
gan: Focke, J, et al.
Cyhoeddwyd: (2021) -
Counting, modular counting and graph homomorphisms
gan: Magkakis, A
Cyhoeddwyd: (2016)