Abstract
Undirected graphs can also be interpreted in another way, namely as a representation of symmetric binary relations. Vertices represent objects and an edge {u, v} indicates that u and v are related. Take the assignment of students which share a room in a dormitory as an example. The students are our objects and the relation is sharing-aroom. The endpoints of any edge are roommates. If there are only double rooms in the dormitory, a pairing of roommates is a matching.
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
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hochstättler, W., Schliep, A. (2010). Matching. In: CATBox. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03822-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-03822-8_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-14887-6
Online ISBN: 978-3-642-03822-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)