Algorithms for the treewidth and minimum fill-in of HHD-free graphs

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science ◽

10.1007/bfb0024492 ◽

1997 ◽

pp. 109-117 ◽

Cited By ~ 4

Author(s):

H. J. Broersma ◽

E. Dahlhaus ◽

T. Kloks

Download Full-text