A polynomial algorithm to find an independent set of maximum weight in a fork-free graph.

Vadim V. Lozin Martin Milanic A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. 26-30 2006 conf/soda/2006 SODA http://doi.acm.org/10.1145/1109557.1109561 db/conf/soda/soda2006.html#LozinM06