Linked from

The 15 pages that link to Augmenting path, each with the reason it gives.

• Matching (graph theory)Related: Flipping its selected and unselected edges increases the matching's size.

• Maximum flow problemRelated: Sending additional flow along such a path improves a nonmaximal feasible flow.

• Bipartite matchingBroader topic: Flipping its edges increases the matching by one pair.

• Hall's marriage theoremRelated: Repeatedly using such paths constructs larger matchings when the condition permits them.

• Perfect matchingRelated: Flipping its edges increases the matching size toward a perfect matching.

• Residual graphRelated: Sending flow along this path changes the original flow by its bottleneck capacity.

• Flow networkRelated: Finding one permits the network’s current flow to grow.

• Ford–Fulkerson algorithmBroader topic: The algorithm increases flow by the path’s smallest residual capacity.

• Edmonds–Karp algorithmRelated: Each iteration selects a shortest augmenting path and increases flow by its bottleneck capacity.

• Max-flow min-cut theoremRelated: Repeated augmentation reaches a maximum flow when no such path remains.

• Hungarian algorithmRelated: Alternating paths enlarge the current assignment without discarding its matched vertices.

• Kőnig's theoremRelated: Finding one lets a matching grow; its absence certifies maximal size.

• Blossom algorithmRelated: Flipping matched status along this path increases the matching by one edge.

• Maximum-cardinality matchingRelated: Flipping membership along this path increases matching size by one.

• Push–relabel maximum flow algorithmCompared with: Push–relabel need not find augmenting paths to make progress.