Maximum Matching Problem
# Definition
The Maximum Matching Problem is an Optimization Problem that asks, given an Undirected Graph $G$ to find a Maximum Matching on $G$.
Search
The Maximum Matching Problem is an Optimization Problem that asks, given an Undirected Graph $G$ to find a Maximum Matching on $G$.