Going Weighted: Parameterized Algorithms for Cluster Editing

DOI10.1007/978-3-540-85097-7_1zbMath1168.68441OpenAlexW2129858303MaRDI QIDQ5505638

Q. B. A. Bui, Sebastian Böcker, Sebastian Briesemeister, Anke Truss

Publication date: 27 January 2009

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85097-7_1

Mathematics Subject Classification ID

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

Related Items (17)

Graph-Based Data Clustering with Overlaps ⋮ Improved Algorithms for Bicluster Editing ⋮ Exact Algorithms for Cluster Editing: Evaluation and Experiments ⋮ Confronting intractability via parameters ⋮ Tight bounds for parameterized complexity of cluster editing with a small number of clusters ⋮ Branch-and-cut approaches for \(p\)-cluster editing ⋮ Exact algorithms for cluster editing: Evaluation and experiments ⋮ Branch-and-price for \(p\)-cluster editing ⋮ Fixed-parameter algorithms for cluster vertex deletion ⋮ Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs ⋮ Efficient algorithms for cluster editing ⋮ Fixed-Parameter Algorithms for Cluster Vertex Deletion ⋮ A more effective linear kernelization for cluster editing ⋮ A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing ⋮ Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms ⋮ Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover ⋮ Going Weighted: Parameterized Algorithms for Cluster Editing

Cites Work

• Unnamed Item
• Graph-modeled data clustering: Exact algorithms for clique generation
• NP-hard problems in hierarchical-tree clustering
• A cutting plane algorithm for a clustering problem
• A general method to speed up fixed-parameter-tractable algorithms
• Automated generation of search tree algorithms for hard graphs modification problems
• Cluster graph modification problems
• The Cluster Editing Problem: Implementations and Experiments
• Exact Algorithms for Cluster Editing: Evaluation and Experiments
• A More Effective Linear Kernelization for Cluster Editing
• Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
• Going Weighted: Parameterized Algorithms for Cluster Editing

This page was built for publication: Going Weighted: Parameterized Algorithms for Cluster Editing