Algorithms Based on the Treewidth of Sparse Graphs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith. Algorithms Based on the Treewidth of Sparse Graphs. In Dieter Kratsch, editor, Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers. Volume 3787 of Lecture Notes in Computer Science, pages 385-396, Springer, 2005. [doi]

This author has not been identified. Look up 'Joachim Kneis' in GoogleThis author has not been identified. Look up 'Daniel Mölle' in GoogleThis author has not been identified. Look up 'Stefan Richter' in GoogleThis author has not been identified. Look up 'Peter Rossmanith' in Google

runs on WebDSL