Going weighted: parameterized algorithms for cluster editing
From MaRDI portal
Recommendations
Cites work
- A cutting plane algorithm for a clustering problem
- A general method to speed up fixed-parameter-tractable algorithms
- A more effective linear kernelization for cluster editing
- Automated generation of search tree algorithms for hard graphs modification problems
- Cluster graph modification problems
- Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
- Exact Algorithms for Cluster Editing: Evaluation and Experiments
- Going weighted: parameterized algorithms for cluster editing
- Graph-modeled data clustering: Exact algorithms for clique generation
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- NP-hard problems in hierarchical-tree clustering
- The Cluster Editing Problem: Implementations and Experiments
Cited in
(45)- A more effective linear kernelization for cluster editing
- Going weighted: parameterized algorithms for cluster editing
- Cluster editing: kernelization based on edge cuts
- A golden ratio parameterized algorithm for cluster editing
- Even faster parameterized cluster deletion and cluster editing
- A simple and improved parameterized algorithm for bicluster editing
- Clustering with partial information
- On the complexity of multi-parameterized cluster editing
- Parameterized algorithms for min-max 2-cluster editing
- On 2-clubs in graph-based data clustering: theory and algorithm engineering
- The Multi-parameterized Cluster Editing Problem
- A PTAS for the Cluster Editing Problem on Planar Graphs
- Cluster editing: kernelization based on edge cuts
- Alternative parameterizations for cluster editing
- A golden ratio parameterized algorithm for cluster editing
- A 2k kernel for the cluster editing problem
- Graph-based data clustering with overlaps
- Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions
- Correlation clustering with same-cluster queries bounded by optimal cost
- On 2-clubs in graph-based data clustering: theory and algorithm engineering
- An improved parameterized algorithm for the p-cluster vertex deletion problem
- Cluster editing
- Going Weighted: Parameterized Algorithms for Cluster Editing
- Parameterized algorithms for module map problems
- \((1,1)\)-cluster editing is polynomial-time solvable
- Structural parameterization of cluster deletion
- Dominator coloring and CD coloring in almost cluster graphs
- Algorithms for 2-club cluster deletion problems using automated generation of branching rules
- A survey of parameterized algorithms and the complexity of edge modification
- Editing graphs into disjoint unions of dense clusters
- Parameterized algorithms for cluster vertex deletion on degree-4 graphs and general graphs
- When can cluster deletion with bounded weights be solved efficiently?
- Improved parameterized algorithms for cluster vertex deletion
- Smaller kernels for 3-leaf power modifications problems
- Exact and heuristic solution approaches for the cluster deletion problem on general graphs
- Structural parameterization of cluster deletion
- Dominator coloring and CD coloring in almost cluster graphs
- Cluster editing parameterized above modification-disjoint P₃-packings
- The complexity of cluster vertex splitting and company
- Cluster editing with locally bounded modifications
- Cluster editing parameterized above modification-disjoint P₃-Packings
- When can cluster deletion with bounded weights be solved efficiently?
- Cluster editing on cographs and related classes
- Graph-modeled data clustering: Exact algorithms for clique generation
- Multistage graph problems on a global budget
This page was built for publication: Going weighted: parameterized algorithms for cluster editing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1040589)
