Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs.

Hajo Broersma, Elias Dahlhaus, Ton Kloks

Browse the full WG paper archive.