Matching Theory (North-Holland Mathematics Studies 121)
October 13, 2018
This study of matching theory deals with bipartite matching, network flows, and presents fundamental results for the non-bipartite case. It goes on to study elementary bipartite graphs and elementary graphs in general. Further discussed are 2-matchings, general matching problems as linear programs, the Edmonds Matching Algorithm (and other algorithmic approaches), f-factors and vertex packing.
Download ToanKho:
http://lk.libvui.com/2OB3lnfx
http://megaurl.in/I0cgsld0
Related posts:
Introduction to Graph Theory
Graph Theory, Computational Intelligence and Thought (Springer 2009)
A Primer in Combinatorics (de Gruyter Textbook)
Algorithmic Graph Theory and Perfect Graphs (Second_Edition__Annals_of_Discrete_Mathematics_57)
Mathematics as Problem Solving
Mathematical Inequalities – (North-Holland Mathematical Library,Vol.67)
Algebra of Proofs (Studies in Logic and the Foundations of Mathematics)
Graph Theory – (Graduate Texts in Mathematics Vol 244)
Graph Theory (Annals of Discrete Mathematics)
Discrete Mathematics with Graph Theory