Method of conditional probabilities: Difference between revisions

Content deleted Content added
Nealeyoung (talk | contribs)
corrected grammatical error
Nealeyoung (talk | contribs)
Line 149:
1. Initialize ''S'' to be the empty set.
2. While there exists a vertex ''u'' in the graph with no neighbor in ''S'':
3. Add such a vertex ''u'' to ''S'', where ''u'' minimizes ''d''(''u'') (the initial degree of ''u'').
4. Return ''S''.