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

researchr

You are not signed in
Sign in
Sign up

Vadim V. Lozin, Martin Milanic. A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006. pages 26-30, ACM Press, 2006. [doi]

This author has not been identified. Look up 'Vadim V. Lozin' in GoogleThis author has not been identified. Look up 'Martin Milanic' in Google

runs on WebDSL