Parameterised and fine-grained subgraph counting, modulo 2
Given a class of graphs H, the problem ⊕Sub(H) is defined as follows. The input is a graph H ∈ H together with an arbitrary graph G. The problem is to compute, modulo 2, the number of subgraphs of G that are isomorphic to H. The goal of this research is to determine for which classes H the problem ⊕...
| Hlavní autoři: | , |
|---|---|
| Médium: | Journal article |
| Jazyk: | English |
| Vydáno: |
Springer
2023
|