Counting Short Cycles in Bipartite Graphs: A Fast Technique/Algorithm and a Hardness Result.

Ali Dehghan Amir H. Banihashemi

Published in: IEEE Trans. Commun. (2020)

Keyphrases

computational complexity
dynamic programming
matching algorithm
np hard
objective function
bipartite graph
learning algorithm
optimal solution
training data
k means
worst case
maximum matching
machine learning
co occurrence
collaborative filtering
search space
information retrieval