An augmenting path alternates between edges outside and inside a matching in a graph and joins two unmatched endpoints. Flipping its edges increases the matching size by one. In an assignment equality graph it moves toward a perfect matching while preserving zero reduced costs on matched edges.
Articles by others on the same topic
There are currently no matching articles.