Login / Signup
-Free Bipartite Graphs in Polynomial Time.
Andreas Brandstädt
Raffaele Mosca
Published in:
CoRR (2020)
Keyphrases
</>
bipartite graph
maximum matching
special case
minimum weight
computational complexity
approximation algorithms
bipartite graph matching
link prediction
maximum cardinality
worst case
information retrieval systems
social network analysis
maximum weight
bipartite networks