On the complexity of counting homomorphisms under surjectivity constraints
<p>Given two graphs G and H, a function h that maps the vertices of G to vertices of H is a (graph) homomorphism if h preserves the edges of G, i.e., whenever two vertices u, v of G share an edge then h(u) and h(v) must share an edge in H. For different H, such homomorphisms represent differen...
| Автор: | |
|---|---|
| Інші автори: | |
| Формат: | Дисертація |
| Мова: | English |
| Опубліковано: |
2020
|
| Предмети: |