Parameterized counting of partially injective homomorphisms
We study the parameterized complexity of the problem of counting graph homomorphisms with given partial injectivity constraints, i.e., inequalities between pairs of vertices, which subsumes counting of graph homomorphisms, subgraph counting and, more generally, counting of answers to equi-join queri...
| Main Author: | |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Springer
2021
|