Going weighted: parameterized algorithms for cluster editing

DOI10.1016/J.TCS.2009.05.006MaRDI QIDQ1040589zbMATH OpenOpenAlexFDO

Authors Q.-B. Bui, Sebastian Böcker, Sebastian Briesemeister, Anke Truss

Publication date 25 November 2009

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2009.05.006

zbMATH Keywords

exact algorithmsfixed-parameter tractabilitydata clustering

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Going Weighted: Parameterized Algorithms for Cluster Editing
• A golden ratio parameterized algorithm for cluster editing
• Alternative parameterizations for cluster editing
• A golden ratio parameterized algorithm for cluster editing
• Efficient algorithms for cluster editing

Cites work

• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• 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
• NP-hard problems in hierarchical-tree clustering
• The Cluster Editing Problem: Implementations and Experiments

Cited in

(34)

• Cluster editing: kernelization based on edge cuts
• A \(2k\) kernel for the cluster editing problem
• Cluster editing: kernelization based on edge cuts
• Multistage graph problems on a global budget
• Dominator coloring and CD coloring in almost cluster graphs
• Algorithms for 2-club cluster deletion problems using automated generation of branching rules
• A more effective linear kernelization for cluster editing
• Cluster editing with locally bounded modifications
• Graph-based data clustering with overlaps
• On the complexity of multi-parameterized cluster editing
• Parameterized algorithms for min-max 2-cluster editing
• Editing graphs into disjoint unions of dense clusters
• On 2-clubs in graph-based data clustering: theory and algorithm engineering
• On 2-clubs in graph-based data clustering: theory and algorithm engineering
• Graph-modeled data clustering: Exact algorithms for clique generation
• scientific article; zbMATH DE number 7525518 (Why is no real title available?)
• Parameterized algorithms for cluster vertex deletion on degree-4 graphs and general graphs
• A simple and improved parameterized algorithm for bicluster editing
• Going weighted: parameterized algorithms for cluster editing
• Even faster parameterized cluster deletion and cluster editing
• The Multi-parameterized Cluster Editing Problem
• Cluster editing
• A golden ratio parameterized algorithm for cluster editing
• Alternative parameterizations for cluster editing
• A survey of parameterized algorithms and the complexity of edge modification
• A golden ratio parameterized algorithm for cluster editing
• Clustering with partial information
• \((1,1)\)-cluster editing is polynomial-time solvable
• Structural parameterization of cluster deletion
• A PTAS for the Cluster Editing Problem on Planar Graphs
• Going Weighted: Parameterized Algorithms for Cluster Editing
• Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions
• Parameterized algorithms for module map problems
• An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem

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)