The following pages link to (Q4437501):
Displaying 13 items.
- The cluster deletion problem for cographs (Q394219) (← links)
- Lower bounds on kernelization (Q456702) (← links)
- Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions (Q494805) (← links)
- Branch-and-cut approaches for \(p\)-cluster editing (Q505422) (← links)
- Cluster editing problem for points on the real line: a polynomial time algorithm (Q1675767) (← links)
- Branch-and-price for \(p\)-cluster editing (Q2013143) (← links)
- Even better fixed-parameter algorithms for bicluster editing (Q2019506) (← links)
- Incompressibility of \(H\)-free edge modification problems: towards a dichotomy (Q2071824) (← links)
- Clustering with qualitative information (Q2568462) (← links)
- (Q5874544) (← links)
- An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion (Q6038703) (← links)
- Structural parameterization of cluster deletion (Q6070784) (← links)
- Cutting a tree with subgraph complementation is hard, except for some small trees (Q6163958) (← links)