1 paper
Moran Feldman, Ariel Szarf
The problem of finding a maximum size matching in a graph (known as the maximum matching problem) is one of the most classical problems in computer science. Despite a significant b…