Programming in networks and graphs. On the combinatorial background and near-equivalence of network flow and matching algorithms (Q1210806)

This is the first book in which network flow and matching algorithms are discussed in a unifying framework. Especially, it is shown that most of the algorithms in both areas can be interpreted as shortest augmenting path methods. More than two thirds of the text are devoted to matching problems (bipartite matching, 1-matching, b-matching) documenting that matching problems are more complex than network flow problems. The book is an excellent source for matching algorithms. It demonstrates the author's practical experience in this area. I highly recommend the text to people interested in theoretical as well as practical aspects of matching problems.