We have introduced two matching problems, the stable matching and the bipartite matching problem. Both are useful problems in practice, and matching is a central problem in graph theory. The proof of the Hall's theorem is not covered in class and is optional.
No comments:
Post a Comment