Pages that link to "Item:Q414871"
From MaRDI portal
The following pages link to A \(2k\) kernel for the cluster editing problem (Q414871):
Displayed 15 items.
- A fast branching algorithm for cluster vertex deletion (Q255285) (← links)
- On making directed graphs transitive (Q414917) (← links)
- Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions (Q494805) (← links)
- A faster algorithm for the cluster editing problem on proper interval graphs (Q495665) (← links)
- An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem (Q511682) (← links)
- Cluster editing with locally bounded modifications (Q713321) (← links)
- Obtaining split graphs by edge contraction (Q897961) (← links)
- Sufficient conditions for edit-optimal clusters (Q903364) (← links)
- Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
- A golden ratio parameterized algorithm for cluster editing (Q1932356) (← links)
- On the complexity of multi-parameterized cluster editing (Q2407948) (← links)
- Parameterized algorithms for min-max 2-cluster editing (Q2410027) (← links)
- A cubic-vertex kernel for flip consensus tree (Q2441594) (← links)
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters (Q2453563) (← links)
- Cluster Editing (Q5326357) (← links)