Graph-based data clustering with overlaps
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1003286 (Why is no real title available?)
- scientific article; zbMATH DE number 3487498 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
- A \(2k\) kernel for the cluster editing problem
- A more effective linear kernelization for cluster editing
- Algorithm Theory - SWAT 2004
- Applying modular decomposition to parameterized cluster editing problems
- Cluster graph modification problems
- Correlation clustering
- Editing graphs into disjoint unions of dense clusters
- Efficient Parameterized Preprocessing for Cluster Editing
- Fixed-parameter enumerability of cluster editing and related problems
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Generalized graph clustering: recognizing (p,q)-cluster graphs
- Going weighted: parameterized algorithms for cluster editing
- Graph clustering
- Graph-modeled data clustering: Exact algorithms for clique generation
- Kernelization: new upper and lower bound techniques
- NP-hard approximation problems in overlapping clustering.
- NP-hard problems in hierarchical-tree clustering
- Parametrized complexity theory.
- Recognition algorithm for diamond-free graphs
- The Cluster Editing Problem: Implementations and Experiments
- The maximum edge biclique problem is NP-complete
Cited in
(40)- Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics
- Overlapping Clustering in a Graph Using k-Means and Application to Protein Interactions Networks
- Algorithms for 2-club cluster deletion problems using automated generation of branching rules
- \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs
- A quadratic vertex kernel for diamond-free edge deletion
- Kernel-based methods to identify overlapping clusters with linear and nonlinear boundaries
- Approximation and tidying -- a problem kernel for s-plex cluster vertex deletion
- Complete mixed integer linear programming formulations for modularity density based clustering
- Graph-Based Data Clustering with Overlaps
- Parameterized algorithms for min-max 2-cluster editing
- Strong cliques in diamond-free graphs
- s-club cluster vertex deletion on interval and well-partitioned chordal graphs
- On 2-clubs in graph-based data clustering: theory and algorithm engineering
- On 2-clubs in graph-based data clustering: theory and algorithm engineering
- A branch-and-price-and-cut method for computing an optimal bramble
- Kernel for \(K_t\)\textsc-free Edge Deletion
- A cubic-vertex kernel for flip consensus tree
- Cluster editing parameterized above modification-disjoint P₃-packings
- The complexity of cluster vertex splitting and company
- A survey of parameterized algorithms and the complexity of edge modification
- Cluster editing parameterized above modification-disjoint P₃-Packings
- Correcting a graph into a linegraph minimizing Hamming distance edition is NP-complete and FPT by treewidth
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- On the advantage of overlapping clusters for minimizing conductance
- Centroid based tree-structured data clustering using vertex/edge overlap and graph edit distance
- A mathematical programming approach to overlapping community detection
- A stratificational overlapping cluster scheme
- Model selection strategies for determining the optimal number of overlapping clusters in additive overlapping partitional clustering
- Watersheds on Hypergraphs for Data Clustering
- On the complexity of 2-club cluster editing with vertex splitting
- A heuristic algorithm for the cluster editing problem
- Using parametric transformations toward polynomial kernels for packing problems allowing overlaps
- Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions
- A faster algorithm for the cluster editing problem on proper interval graphs
- A new approximate cluster deletion algorithm for diamond-free graphs
- Explicit linear kernels for packing problems
- Kernelization algorithms for packing problems allowing overlaps
- An improved parameterized algorithm for the p-cluster vertex deletion problem
- Finding Non-Overlapping Clusters for Generalized Inference Over Graphical Models
- Parameterized lower bound and NP-completeness of some \(H\)-free edge deletion problems
This page was built for publication: Graph-based data clustering with overlaps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456688)
