Abstract
It will be shown in this chapter that numerous problems concerning the matchings of bipartite graphs (as, for instance, those on maximal matchings, minimal separation sets, deficiencies, systems of representatives, etc.) may be regarded as problems of pseudo-Boolean programming and handled with the methods described in Chapters III–VI. Outstanding examples are the assignment and transportation problems, discussed in § 2.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1968 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hammer, P.L., Rudeanu, S. (1968). Matchings of Bipartite Graphs. In: Boolean Methods in Operations Research and Related Areas. Ökonometrie und Unternehmensforschung / Econometrics and Operations Research, vol 7. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-85823-9_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-85823-9_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-85825-3
Online ISBN: 978-3-642-85823-9
eBook Packages: Springer Book Archive