Finding all minimum-cost perfect matchings in Bipartite graphs.

Komei Fukuda Tomomi Matsui

Published in: Networks (1992)

Keyphrases

minimum cost
bipartite graph
maximum cardinality
network flow
np hard
approximation algorithms
spanning tree
maximum matching
network flow problem
capacity constraints
minimum weight
network simplex algorithm
undirected graph
bipartite graph matching
minimum cost flow
training set
lower bound
learning algorithm