Abstract
In the preceding chapter we mentioned the problem of devising a “global criterion” for deciding whether one matching is better than another. We noted that no such criterion appears to exist in general. Nevertheless, there are some cases where simple criteria suffice. For instance, if each possible pairing is either permitted or not permitted, with no other relative preferences given, then we have no trouble. This is known as the maximum matching problem.
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
© 1983 Springer Science+Business Media New York
About this chapter
Cite this chapter
Pólya, G., Tarjan, R.E., Woods, D.R. (1983). Matchings (Maximum Matchings). In: Notes on Introductory Combinatorics. Progress in Computer Science, vol 4. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4757-1101-1_11
Download citation
DOI: https://doi.org/10.1007/978-1-4757-1101-1_11
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-0-8176-3170-3
Online ISBN: 978-1-4757-1101-1
eBook Packages: Springer Book Archive