Pages that link to "Item:Q456688"

The following pages link to Graph-based data clustering with overlaps (Q456688):

Displaying 24 items.

• Kernel-based methods to identify overlapping clusters with linear and nonlinear boundaries (Q269541) (← 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)
• Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
• Explicit linear kernels for packing problems (Q1739112) (← links)
• A branch-and-price-and-cut method for computing an optimal bramble (Q1751138) (← links)
• Complete mixed integer linear programming formulations for modularity density based clustering (Q1751238) (← links)
• A mathematical programming approach to overlapping community detection (Q2162210) (← links)
• Model selection strategies for determining the optimal number of overlapping clusters in additive overlapping partitional clustering (Q2169873) (← links)
• A new approximate cluster deletion algorithm for diamond-free graphs (Q2292150) (← links)
• Parameterized algorithms for min-max 2-cluster editing (Q2410027) (← links)
• Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion (Q2429325) (← 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)
• On 2-clubs in graph-based data clustering: theory and algorithm engineering (Q2692726) (← links)
• Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics (Q2827798) (← links)
• Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps (Q2828236) (← links)
• Kernelization Algorithms for Packing Problems Allowing Overlaps (Q2948487) (← links)
• On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering (Q5084692) (← links)
• Algorithms for 2-club cluster deletion problems using automated generation of branching rules (Q6140356) (← links)
• \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs (Q6145821) (← links)
• A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)