The following pages link to Cluster deletion revisited (Q2234801):
Displaying 11 items.
- The cluster deletion problem for cographs (Q394219) (← links)
- An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem (Q511682) (← links)
- Even faster parameterized cluster deletion and cluster editing (Q1944120) (← links)
- Cluster deletion on interval graphs and split related graphs (Q2037103) (← links)
- Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule? (Q2186825) (← links)
- A new approximate cluster deletion algorithm for diamond-free graphs (Q2292150) (← 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)
- Kernel for \(K_t\)\textsc{-free Edge Deletion} (Q2656346) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710795) (← links)
- Algorithms for 2-club cluster deletion problems using automated generation of branching rules (Q6140356) (← links)
- Parameterized algorithms for cluster vertex deletion on degree-4 graphs and general graphs (Q6591469) (← links)
