Login / Signup
The complexity of counting graph homomorphisms.
Martin E. Dyer
Catherine S. Greenhill
Published in:
Random Struct. Algorithms (2000)
Keyphrases
</>
graph theory
computational complexity
worst case
random walk
graph theoretic
neural network
data sets
graph representation
space complexity
stable set
graph based algorithm
graph search
graph structure
decision problems
social network analysis
np hard
image segmentation