Linear time low tree-width partitions and algorithmic consequences - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Jaroslav Nesetril, Patrice Ossona de Mendez. Linear time low tree-width partitions and algorithmic consequences. In Jon M. Kleinberg, editor, Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006. pages 391-400, ACM, 2006. [doi]

This author has not been identified. Look up 'Jaroslav Nesetril' in GoogleThis author has not been identified. Look up 'Patrice Ossona de Mendez' in Google

runs on WebDSL