Pages that link to "Item:Q1725643"
From MaRDI portal
The following pages link to Cutwidth: obstructions and algorithmic aspects (Q1725643):
Displaying 13 items.
- Derivation of algorithms for cutwidth and related graph layout parameters (Q1015810) (← links)
- A Menger-like property of tree-cut width (Q1998754) (← links)
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem (Q2029285) (← links)
- Towards Algorithmic Cut-Introduction (Q2891453) (← links)
- Computing Tree Decompositions (Q5042458) (← links)
- Algorithmic Applications of Tree-Cut Width (Q5048301) (← links)
- Lean Tree-Cut Decompositions: Obstructions and Algorithms (Q5090482) (← links)
- Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth (Q5131225) (← links)
- Cutwidth I: A linear time fixed parameter algorithm (Q5462383) (← links)
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions (Q6038588) (← links)
- Strong SDP based bounds on the cutwidth of a graph (Q6065655) (← links)
- Order Reconfiguration under Width Constraints (Q6075707) (← links)
- Faster parameterized algorithms for modification problems to minor-closed classes (Q6601299) (← links)
