Maximum matchings in bipartite graphs via strong spanning trees.

Michel L. Balinski Jaime Gonzalez

Published in: Networks (1991)

Keyphrases

spanning tree
maximum cardinality
minimum weight
bipartite graph
minimum spanning tree
edge disjoint
minimum cost
edge weights
minimum spanning trees
maximum matching
undirected graph
graph clustering
weighted graph
bipartite graph matching
data sets
link prediction
random walk
xml documents
information retrieval