Classical bipartite cardinality matching

Abstract view

Algorithmic problem: Cardinality-maximal matching in bipartite graphs.

Type of algorithm: loop.

Invariant: [math]\displaystyle{ M }[/math] is a matching in [math]\displaystyle{ G }[/math].

Variant: [math]\displaystyle{ |M| }[/math] is increased by one.

Break condition: There is no more augmenting path.

Induction basis

Abstract view: Initialize [math]\displaystyle{ M }[/math] to be a feasible matching, for example, the empty matching.

Induction step:

Abstract view:

1. Search for an augmenting path.
2. If there is none, the loop terminates.
3. Let [math]\displaystyle{ p }[/math] denote the augmenting path found in step 1.
4. Augment [math]\displaystyle{ M }[/math] along [math]\displaystyle{ p }[/math].

Implementation of step 1: From every exposed node, a modified ??? is started. This repeated ??? is finished once an augmenting path has been found. The modification of ??? is as follows:

1. Whenever the current node [math]\displaystyle{ v }[/math] has been reached via an edge in [math]\displaystyle{ M }[/math], only edges in [math]\displaystyle{ E\setminus M }[/math] are considered for going forward from [math]\displaystyle{ v }[/math].
2. Mirror-symmetrically, whenever the current node [math]\displaystyle{ v }[/math] has been reached via an edge in [math]\displaystyle{ E\setminus M }[/math], only the (unique) edge in [math]\displaystyle{ M }[/math], if existing, is considered for going forward.

Proof: Basically, we have to show that there is no more augmenting path if this modified DFS does not find one. So suppose for a contradiction that a search from an exposed node [math]\displaystyle{ u }[/math] fails although there is an augmenting path starting in [math]\displaystyle{ u }[/math].

Remark: This modified DFS could be realized by a regular DFS:

1. Duplicate each matched node [math]\displaystyle{ v }[/math] giviong [math]\displaystyle{ v_1 }[/math] and [math]\displaystyle{ v_2 }[/math].
2. Replace each edge [math]\displaystyle{ \{v,w|} }[/math] by two arcs, [math]\displaystyle{ (v,w) }[/math] and [math]\displaystyle{ (w,v) }[/math].
3. For each matched node [math]\displaystyle{ v }[/math]:
   1. Let all incoming arcs of [math]\displaystyle{ v }[/math] in [math]\displaystyle{ M }[/math] point to [math]\displaystyle{ v_1 }[/math] and all outgoing arcs in [math]\displaystyle{ E\setminus M }[/math] leave [math]\displaystyle{ v_1 }[/math].
   2. Mirror-symmetrically, let all incoming arcs of [math]\displaystyle{ v }[/math] in [math]\displaystyle{ E\setminus M }[/math] point to [math]\displaystyle{ v_2 }[/math] and all outgoing arcs of [math]\displaystyle{ v }[/math] in [math]\displaystyle{ M }[/math] leave [math]\displaystyle{ v_2 }[/math].