Author： Bodlaender H.L. van Leeuwen J. Tan R. Thilikos D.M.
Publisher： Academic Press
ISSN： 0890-5401
Source： Information and Computation, Vol.139, Iss.1, 1997-11, pp. : 92-109
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
Worst Case Bounds for Shortest Path Interval Routing
Journal of Algorithms, Vol. 27, Iss. 1, 1998-04 ,pp. :
Access to resources
Recommend
By Bodlaender H.L. Engelfriet J.
Journal of Algorithms, Vol. 24, Iss. 1, 1997-07 ,pp. :
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. :