Author： Bodlaender H.L. Engelfriet J.
Publisher： Academic Press
ISSN： 0196-6774
Source： Journal of Algorithms, Vol.24, Iss.1, 1997-07, pp. : 94-123
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
On Interval Routing Schemes and Treewidth
By Bodlaender H.L. van Leeuwen J. Tan R. Thilikos D.M.
Information and Computation, Vol. 139, Iss. 1, 1997-11 ,pp. :
Access to resources
Recommend
Reduction Algorithms for Graphs of Small Treewidth
By Bodlaender H.L. van Antwerpen-de Fluiter B.
Information and Computation, Vol. 167, Iss. 2, 2001-06 ,pp. :
Treewidth of the Line Graph of a Complete Graph
JOURNAL OF GRAPH THEORY, Vol. 79, Iss. 1, 2015-05 ,pp. :
Linearity of grid minors in treewidth with applications through bidimensionality
By Demaine Erik
Combinatorica, Vol. 28, Iss. 1, 2008-01 ,pp. :
Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes
Journal of Algorithms, Vol. 43, Iss. 1, 2002-04 ,pp. :