Counting and finding homomorphisms is universal for parameterized complexity theory
<br/>Counting homomorphisms from a graph H into another graph G is a fundamental problem of (parameterized) counting complexity theory. In this work, we study the case where both graphs H and G stem from given classes of graphs: H ϵ and G ϵ . By this, we combine the structurally restricted ve...
| Päätekijät: | , |
|---|---|
| Aineistotyyppi: | Conference item |
| Julkaistu: |
Society for Industrial and Applied Mathematics
2020
|