Pages that link to "Item:Q414871"

The following pages link to A \(2k\) kernel for the cluster editing problem (Q414871):

Displaying 26 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)
• A \((3+\epsilon)k\)-vertex kernel for edge-disjoint triangle packing (Q1628680) (← links)
• Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
• A golden ratio parameterized algorithm for cluster editing (Q1932356) (← links)
• A simple and improved parameterized algorithm for bicluster editing (Q2059879) (← links)
• (Sub)linear kernels for edge modification problems toward structured graph classes (Q2093576) (← links)
• A new temporal interpretation of cluster editing (Q2169957) (← links)
• Parameterized dynamic cluster editing (Q2223691) (← links)
• Kernels for packing and covering problems (Q2272393) (← 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)
• Kernel for \(K_t\)\textsc{-free Edge Deletion} (Q2656346) (← links)
• Parameterized Dynamic Cluster Editing (Q5090987) (← links)
• \((1,1)\)-cluster editing is polynomial-time solvable (Q6048436) (← links)
• A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
• On the parameterized complexity of s-club cluster deletion problems (Q6165557) (← links)
• Asymptotic bounds for clustering problems in random graphs (Q6196888) (← links)