The complexity of counting homomorphisms to cactus graphs modulo 2.

Andreas Göbel Leslie Ann Goldberg David Richerby

Published in: ACM Trans. Comput. Theory (2014)

Keyphrases

graph theory
computational complexity
computational cost
worst case
graph matching
graph mining
graph theoretic
subgraph isomorphism
data sets
information systems
image segmentation
description logics
decision problems
directed graph
space complexity