Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I have a rather cryptic pseudo code version of the augmenting path algorithm for finding a maximum matching in a bipartite graph in my notes.

I m not sure it s correct, and there are some parts that don t make too much sense to me yet.

Unfortunately Cormen is taking a different approach to the problem, so if somebody has experience with the algorithm and knows a very good and reliable source where I can find the correct pseudo code ideally with explanations this would be really appreciated ! (I am looking for the standard algorithm that works in polynomial time on the basis that given a matching M, if there is a bigger matching M' there must be an augmenting path P.)

share|cite|improve this question
Note that there's an auto-completion feature for the tags. In the present case, "(reference-request)" should have been offered when you entered "(reference)". – joriki Feb 3 '12 at 1:51

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.