Login / Signup
Computing the number of h-edge spanning forests in complete bipartite graphs.
Rebecca J. Stones
Published in:
Discret. Math. Theor. Comput. Sci. (2014)
Keyphrases
</>
bipartite graph
machine learning
learning algorithm
computational complexity
np hard
maximum matching