Problems related to general graph matching

Revision en1, by MiFaFaOvO, 2018-12-03 19:09:46

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.

You can find the template here and here.

The shortest code of the maximum cost matching problem is about 5.7k.

  1. Chinese postman problem. Find a shortest closed path or circuit that visits every edge of a (connected) undirected graph.


  Rev. Lang. By When Δ Comment
en6 English MiFaFaOvO 2018-12-04 19:00:42 9 Tiny change: 'ndirected weighted ' -> 'ndirected positive weighted '
en5 English MiFaFaOvO 2018-12-04 14:33:53 112
en4 English MiFaFaOvO 2018-12-04 09:45:32 6 Tiny change: 'SPOIL ALERT : I' -> 'SPOILER ALERT : I'
en3 English MiFaFaOvO 2018-12-04 09:24:32 206
en2 English MiFaFaOvO 2018-12-03 20:45:43 2396 (published)
en1 English MiFaFaOvO 2018-12-03 19:09:46 620 Initial revision (saved to drafts)