Abstract
So far we have introduced the combinatorial structures which are relevant when working with b-matchings in graphs and we have extended the concept of extreme matchings to the b-matching case. Again this concept builts the basis for the shortest augmenting path approach.
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). b-Matching Algorithms. 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_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-51713-6_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18969-5
Online ISBN: 978-3-642-51713-6
eBook Packages: Springer Book Archive