The complexity of counting colourings and independent sets in sparse graphs and hypergraphs.

Catherine S. Greenhill

Published in: Comput. Complex. (2000)

Keyphrases

graph theory
computational complexity
worst case
neural network
space complexity
feature selection
data sets
sparse data
sparse matrix
directed acyclic
computational cost
feature space
bipartite graph
graph representation
graph theoretic
decomposition methods
graph structures
adjacency matrix