Kloks, Ton; Bodlaender, Hans Approximating tree width and pathwidth of some classes of perfect graphs. (English) Zbl 0925.05052 Ibaraki, Toshihide (ed.) et al., Algorithms and computation. 3rd international symposium, ISAAC ’92. Nagoya, Japan, December 16–18, 1992. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 650, 116-125 (1992). For the entire collection see [Zbl 0856.00041]. Cited in 10 Documents MSC: 05C85 Graph algorithms (graph-theoretic aspects) 68Q25 Analysis of algorithms and problem complexity 68R10 Graph theory (including graph drawing) in computer science PDFBibTeX XMLCite \textit{T. Kloks} and \textit{H. Bodlaender}, Lect. Notes Comput. Sci. 650, 116--125 (1992; Zbl 0925.05052)