This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics articles
This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles
Latest comment: 14 years ago2 comments2 people in discussion
Can I get a citation for the greedy algorithm? I think it's not correct. Suppose a graph with four nodes V = {a,b,c,d} that form a line, i.e. E = {(a,b),(b,c),(c,d)}. Choosing (b,c) forms a maximal matching, but there is no way to greedily extend it to a minimal edge cover (that is {(a,b),(c,d)} in this graph). I googled around a bit but found nothing relevant. --134.96.156.86 (talk)
Right. Regarding citations, e.g. in [1] you can find the theorem "the size of the minimum edge cover plus the size of the maximum number of independent edges equals the number of vertices of a graph"; note that "independent edges" = "matching". An easy way to prove this theorem is to consider the simple algorithm that greedily extends a maximum matching; once you have established the correctness of the algorithm, this theorem follows as a simple corollary (and vice versa). I think we could discuss this connection in more detail on this page. — Miym (talk) 17:54, 21 December 2009 (UTC)Reply
level-5 vital article is rated Start-class on Wikipedia's content assessment scale.
