A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller. A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking. In Juraj Hromkovic, Ondrej Sýkora, editors, Graph-Theoretic Concepts in Computer Science, 24th International Workshop, WG 98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings. Volume 1517 of Lecture Notes in Computer Science, pages 88-99, Springer, 1998.

This author has not been identified. Look up 'Hajo Broersma' in GoogleThis author has not been identified. Look up 'Ton Kloks' in GoogleThis author has not been identified. Look up 'Dieter Kratsch' in GoogleThis author has not been identified. Look up 'Haiko Müller' in Google

runs on WebDSL