Cutwidth: obstructions and algorithmic aspects (Q1725643): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4792909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $$O(\log \mathrm{OPT})$$ O ( log OPT ) -Approximation for Covering/Packing Minor Models of $$\theta _{r}$$ θ r / rank
 
Normal rank
Property / cites work
 
Property / cites work: A well-quasi-order for tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Computation of Path-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-width and well-quasi-ordering in matroids and graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A weak immersion relation on graphs and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutwidth of Split Graphs and Threshold Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-width, path-width, and cutwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds on the size of obstructions and intertwines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors XXIII. Nash-Williams' immersion conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Call routing and the ratcatcher / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal acyclic forbidden minors for the family of graphs with bounded path-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutwidth I: A linear time fixed parameter algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutwidth II: Algorithms for partial w-trees of bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Menger-like property of tree-width: The finite case / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of graphs not admitting a fixed immersion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for the min-cut linear arrangement of trees / rank
 
Normal rank

Revision as of 06:07, 18 July 2024

scientific article
Language Label Description Also known as
English
Cutwidth: obstructions and algorithmic aspects
scientific article

    Statements

    Cutwidth: obstructions and algorithmic aspects (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    14 February 2019
    0 references
    cutwidth
    0 references
    obstructions
    0 references
    immersions
    0 references
    fixed-parameter tractability
    0 references
    0 references
    0 references

    Identifiers