Finding all minimum-cost perfect matchings in Bipartite graphs. Fukuda, K. & Matsui, T. Networks, 22(5):461--468, August, 1992.
Finding all minimum-cost perfect matchings in Bipartite graphs [link]Paper  doi  bibtex   
@article{ Fukuda1992,
  author = {Fukuda, Komei and Matsui, Tomomi},
  doi = {10.1002/net.3230220504},
  issn = {00283045},
  journal = {Networks},
  month = {August},
  number = {5},
  pages = {461--468},
  title = {{Finding all minimum-cost perfect matchings in Bipartite graphs}},
  url = {http://doi.wiley.com/10.1002/net.3230220504},
  volume = {22},
  year = {1992}
}

Downloads: 0