Pages that link to "Item:Q5925651"
From MaRDI portal
The following pages link to A tight approximation algorithm for the cluster vertex deletion problem (Q5925651):
Displaying 9 items.
- Faster parameterized algorithm for cluster vertex deletion (Q2035480) (← links)
- Improved approximation algorithms for hitting 3-vertex paths (Q2191773) (← links)
- Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion (Q2429325) (← links)
- On the \(d\)-claw vertex deletion problem (Q2695329) (← links)
- Kernelization through Tidying (Q3557047) (← links)
- \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs (Q6145821) (← links)
- On the parameterized complexity of s-club cluster deletion problems (Q6165557) (← links)
- Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs (Q6489319) (← links)
- Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints (Q6657233) (← links)