The number of spanning forests of a graph.

Yasuo Teranishi

Published in: Discret. Math. (2005)

Keyphrases

bayesian networks
image sequences
computational complexity
np complete
random walk
connected components
directed graph
memory requirements
bipartite graph
directed acyclic graph
maximum number