Pages that link to "Item:Q1944120"
From MaRDI portal
The following pages link to Even faster parameterized cluster deletion and cluster editing (Q1944120):
Displaying 18 items.
- The cluster deletion problem for cographs (Q394219) (← 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)
- Complexity of the cluster deletion problem on subclasses of chordal graphs (Q496003) (← links)
- Branch-and-cut approaches for \(p\)-cluster editing (Q505422) (← links)
- An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem (Q511682) (← links)
- Cluster editing with locally bounded modifications (Q713321) (← links)
- A golden ratio parameterized algorithm for cluster editing (Q1932356) (← links)
- Branch-and-price for \(p\)-cluster editing (Q2013143) (← links)
- The maximum independent union of cliques problem: complexity and exact approaches (Q2174276) (← links)
- Cluster deletion revisited (Q2234801) (← links)
- A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to \(P_4\)-sparse graphs (Q2345859) (← links)
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters (Q2453563) (← links)
- Destroying Bicolored $P_3$s by Deleting Few Edges (Q5038193) (← links)
- Cluster Editing (Q5326357) (← links)
- On the relation of strong triadic closure and cluster deletion (Q5915591) (← links)
- Algorithms for 2-club cluster deletion problems using automated generation of branching rules (Q6140356) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
