Maximum matchings in bipartite graphs via strong spanning trees

M. L. Balinski, J. Gonzalez. Maximum matchings in bipartite graphs via strong spanning trees. Networks, 21(2):165-179, 1991. [doi]

@article{BalinskiG91,
  title = {Maximum matchings in bipartite graphs via strong spanning trees},
  author = {M. L. Balinski and J. Gonzalez},
  year = {1991},
  doi = {10.1002/net.3230210203},
  url = {http://dx.doi.org/10.1002/net.3230210203},
  researchr = {https://researchr.org/publication/BalinskiG91},
  cites = {0},
  citedby = {0},
  journal = {Networks},
  volume = {21},
  number = {2},
  pages = {165-179},
}