Pages that link to "Item:Q1811082"

The following pages link to On cutting a few vertices from a graph (Q1811082):

Displaying 12 items.

• Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems (Q295639) (← links)
• Heuristics for the data arrangement problem on regular trees (Q498454) (← links)
• A new approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem (Q896163) (← links)
• An improved approximation algorithm for requirement cut (Q991474) (← links)
• Parameterized complexity of immunization in the threshold model (Q2154106) (← links)
• Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization (Q2343085) (← links)
• The vertex \(k\)-cut problem (Q2419357) (← links)
• Unbalanced graph cuts with minimum capacity (Q2515430) (← links)
• Cutting up is hard to do: the parameterised complexity of \(k\)-cut and related problems (Q2843923) (← links)
• On the Parameterized Complexity of Cutting a Few Vertices from a Graph (Q2849930) (← links)
• (Q3444803) (← links)
• Immunization in the threshold model: a parameterized complexity study (Q6069928) (← links)