Technical Report CS0648

TR#:CS0648
Class:CS
Title: A NOTE ON TREE-WIDTH, PATH-WIDTH AND CUTWIDTH
Authors: E. Korach and Nir Solel
PDFCS0648.pdf
Abstract: Let tw(G), pw(G), c(G), !J.(G) denote, respectively, the tree-width, path-width, cutwidth and the maximum degree of a graph G on 11 vertices . It is known that c (G)~tw (G). We prove that c (G) =0 (tw (G)!J.(G)logn), and if ({Xj : iel] ,T=(I,A is a tree decomposition of G with tree-wid~ then c(G) S (k+l)!J.(G)c (T). In case that a tree decomposition is given, or that the tree-width is bounded by a constant, efficient algorithms for finding a numoering with cutwidth within the upper bounds are implicit in the proofs. We obtain the above results by showing that pw(G)=O(log ntw(G, and pw (G )!:(k+1)c (T).
CopyrightThe above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information

Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1990/CS/CS0648), rather than to the URL of the PDF files directly. The latter URLs may change without notice.

To the list of the CS technical reports of 1990
To the main CS technical reports page

Computer science department, Technion
admin