On the Computational Complexity of Finding Bipartite Graphs with a Small Number of Short Cycles and Large Girth.

Ali Dehghan Amir H. Banihashemi

Published in: ITW (2019)

Keyphrases

bipartite graph
small number
computational complexity
maximum matching
minimum weight
graph model
link prediction
maximum cardinality
graph clustering
bipartite networks
learning algorithm
search engine
np complete
maximum weight
stable set
bipartite graph matching