Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon.

Pages: 1-

Edmonds algorithm

Name: Anonymous 2010-06-04 13:51

Does anyone know it? Anyone ever tried to find perfect matching with minimal cost on weighted graphs? Anyone has any good info about it? I've found a couple of books and pdfs thanks to google, from which the best seemed Wattenhoffers pdf, however I can't understand 2 things from it...

Name: Anonymous 2010-06-04 13:56

I used to have consentual man-love with Edmonds back in the late 60s. It was all the rage at the time.

Name: Anonymous 2010-06-04 14:11

␀

Name: Anonymous 2010-06-04 15:20

␀␀␀␀␀␀␀␀␀␀␀␀␀␀␀␀␀␀␀␀␀␀␀␀␀␀␀␀␀␀␀␀␀␀␀

Name: Anonymous 2010-06-05 3:13

^NU_L

Name: Anonymous 2010-06-05 8:06

How about any algorithm to find minimal weight perfect matching in graph?

Name: Anonymous 2010-06-05 10:06

Sorry, I haven't really had an use for anything beyond bipartite matching.

Name: Anonymous 2010-06-05 12:22

I see, well I need it for solving TSP with Match Twice and Stitch method.

Name: Anonymous 2011-02-04 14:25

Name: Anonymous 2011-02-18 14:04

<-- check my doubles

Edmonds algorithm

1 Name: Anonymous 2010-06-04 13:51

2 Name: Anonymous 2010-06-04 13:56

3 Name: Anonymous 2010-06-04 14:11

4 Name: Anonymous 2010-06-04 15:20

5 Name: Anonymous 2010-06-05 3:13

6 Name: Anonymous 2010-06-05 8:06

7 Name: Anonymous 2010-06-05 10:06

8 Name: Anonymous 2010-06-05 12:22

10 Name: Anonymous 2011-02-04 14:25

11 Name: Anonymous 2011-02-18 14:04