Abstract
Let G be an undirected graph with weight function w. Recall from last lecture that the weight of a matching M in G, denoted w(M), is the sum of the weights of the edges in M, and the incremental weight of a set A of edges, denoted Δ(A), is the sum of the weights of the unmatched edges in A less the sum of the weights of the matched edges in A. For an augmenting path p, Δ(p) gives the net change in weight that would be obtained by augmenting by p.
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
© 1992 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Kozen, D.C. (1992). More on Matching. In: The Design and Analysis of Algorithms. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4400-4_20
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4400-4_20
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-8757-5
Online ISBN: 978-1-4612-4400-4
eBook Packages: Springer Book Archive