Abstract
In this chapter we discuss the problem of finding a matching of maximal cardinality in a general (nonbipartite) graph G = (V, E). We will first introduce some combinatorial structures which typically arise in nonbipartite graphs and which have to be handled in cardinality matching algorithms. We also state the nonbipartite counterparts of the “existence theorems” and “characterizations” of perfect matchings in bipartite graphs. Then we present the alternating path labeling method for solving the cardinality matching problem in non-bipartite graphs.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Derigs, U. (1988). The Cardinality Matching Problem. In: Programming in Networks and Graphs. Lecture Notes in Economics and Mathematical Systems, vol 300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-51713-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-51713-6_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18969-5
Online ISBN: 978-3-642-51713-6
eBook Packages: Springer Book Archive