Tree-width, path-width, and cutwidth (Q1801672): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4734761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with small bandwidth and cutwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimizing width in linear layouts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3725545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. IV: Tree-width and well-quasi-ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for the min-cut linear arrangement of trees / rank
 
Normal rank

Latest revision as of 16:25, 17 May 2024

scientific article
Language Label Description Also known as
English
Tree-width, path-width, and cutwidth
scientific article

    Statements

    Tree-width, path-width, and cutwidth (English)
    0 references
    0 references
    0 references
    17 August 1993
    0 references
    The authors prove an asymptotic estimate of the cutwidth \(\text{c} (G)\) of a graph \(G\) on \(n\) vertices in terms of its tree-width \(\text{tw} (G)\).
    0 references
    decomposition
    0 references
    cutwidth
    0 references
    tree-width
    0 references

    Identifiers