Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Hajo Broersma, Elias Dahlhaus, Ton Kloks. Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs. In Rolf H. Möhring, editor, Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, WG 97, Berlin, Germany, June 18-20, 1997, Proceedings. Volume 1335 of Lecture Notes in Computer Science, pages 109-117, Springer, 1997.

This author has not been identified. Look up 'Hajo Broersma' in GoogleThis author has not been identified. Look up 'Elias Dahlhaus' in GoogleThis author has not been identified. Look up 'Ton Kloks' in Google

runs on WebDSL