Login / Signup
Optimal Partition of a Bipartite Graph with Prescribed Layout into Non-Crossing b-Matchings.
Federico Malucelli
Sara Nicoloso
Published in:
Electron. Notes Discret. Math. (2005)
Keyphrases
</>
bipartite graph
maximum cardinality
maximum matching
minimum weight
bipartite graph matching
optimal solution
graph model
dynamic programming
maximum weight
machine learning
information retrieval
learning algorithm
graph clustering
hits algorithm