It looks there are few problems about general graph matching in the community. And there are a few teams who solved problem B in NEERC both online and onsite.
The shortest code of the maximum cost matching problem is about 5.7k.
- Chinese postman problem. Find a shortest closed path or circuit that visits every edge of a (connected) undirected graph.