-Free Bipartite Graphs in Polynomial Time.

Andreas Brandstädt Raffaele Mosca

Published in: CoRR (2021)

Keyphrases

bipartite graph
maximum matching
computational complexity
special case
link prediction
minimum weight
approximation algorithms
maximum cardinality
graph clustering
worst case
bipartite networks
mutual reinforcement
social networks
search engine
learning algorithm
bipartite graph matching
machine learning