Author： Bodlaender H.L. Kloks T.
Publisher： Academic Press
ISSN： 0196-6774
Source： Journal of Algorithms, Vol.21, Iss.2, 1996-09, pp. : 358-402
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
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. :
Access to resources
Recommend
Approximation of pathwidth of outerplanar graphs
Journal of Algorithms, Vol. 43, Iss. 2, 2002-05 ,pp. :
Circumference and Pathwidth of Highly Connected Graphs
JOURNAL OF GRAPH THEORY, Vol. 79, Iss. 3, 2015-07 ,pp. :
Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes
Journal of Algorithms, Vol. 43, Iss. 1, 2002-04 ,pp. :
Parallel Algorithms for Reducible Flow Graphs
Journal of Algorithms, Vol. 23, Iss. 1, 1997-04 ,pp. :