| Input: a tree with a vertex as its root. | | Output: a minimum -component vertex covering of . | | (1) | | | (2) | while , do | | (3) | set , , for each | | (4) | if | | (5) | choose a vertex | | (6) | if , set , go to Step 2 | | (7) | if , put , and put , go to Step 4 | | (8) | else | | (9) | replace | | (10) | for each , go to Step 4 | | (11) | end if | | (12) | end while | | (13) | return |
|
