Perfect Matching Problem
# Definition
The Perfect Matching Problem is a Decision Problem that asks whether a given Undirected Graph $G$ has a Perfect Matching.
Search
The Perfect Matching Problem is a Decision Problem that asks whether a given Undirected Graph $G$ has a Perfect Matching.