The complexity of counting graph homomorphisms (extended abstract).
Martin E. DyerCatherine S. GreenhillPublished in: SODA (2000)
Keyphrases
- extended abstract
- graph theory
- random walk
- graph construction
- graph representation
- graph structure
- data mining
- graph search
- graph model
- weighted graph
- bipartite graph
- directed graph
- structured data
- computational cost
- graph matching
- space complexity
- spanning tree
- computational complexity
- complexity analysis
- graph theoretic
- genetic algorithm
- data sets
- polynomial time complexity