Timeline for complexity of finding optimal matchings of given fixed size
Current License: CC BY-SA 3.0
3 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Feb 23, 2013 at 10:03 | comment | added | Manfred Weis | @David: your answer really solves the problem in an elegant way; I had checked some literature, but couldn't anything like that. A minor remark: the weights of the newly added edges should all be the same so that the original matching isn't altered, but that's fairly obvious. | |
Feb 23, 2013 at 9:47 | vote | accept | Manfred Weis | ||
Feb 22, 2013 at 11:01 | history | answered | David Herskovics | CC BY-SA 3.0 |