Maximum Matchings of a Digraph Based on the Largest Geometric Multiplicity

Figure 2

Matching in a digraph and its bipartite representation. (a) A simple digraph is composed of five nodes and five edges. (b) The bipartite representation of the digraph shown in (a). Its maximum matching is displayed in green. Matched (or unmatched) nodes are displayed in green (or red), respectively.

(a)

(b)