Pages that link to "Item:Q2891354"
From MaRDI portal
The following pages link to On Cutwidth Parameterized by Vertex Cover (Q2891354):
Displaying 6 items.
- Treewidth and pathwidth parameterized by the vertex cover number (Q344839) (← links)
- Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050) (← links)
- Computing tree-depth faster than \(2^n\) (Q493242) (← links)
- Maximum common induced subgraph parameterized by vertex cover (Q2445395) (← links)
- Treewidth and Pathwidth Parameterized by the Vertex Cover Number (Q2842160) (← links)
- On the Parameterized Complexity of Cutting a Few Vertices from a Graph (Q2849930) (← links)