Alternative Parameterizations for Cluster Editing

DOI10.1007/978-3-642-18381-2_29zbMath1298.68201OpenAlexW1843372511MaRDI QIDQ3075528

Christian Komusiewicz, Johannes Uhlmann

Publication date: 15 February 2011

Published in: SOFSEM 2011: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-18381-2_29

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (5)

Cluster Editing ⋮ A golden ratio parameterized algorithm for cluster editing ⋮ Structural parameterization of cluster deletion ⋮ On making directed graphs transitive ⋮ Cluster editing with locally bounded modifications

Cites Work

• Correlation clustering
• Graph-modeled data clustering: Exact algorithms for clique generation
• Fixed-parameter enumerability of cluster editing and related problems
• Fixed-parameter algorithms for cluster vertex deletion
• A more effective linear kernelization for cluster editing
• Going weighted: parameterized algorithms for cluster editing
• NP-hard problems in hierarchical-tree clustering
• Cluster graph modification problems
• Applying modular decomposition to parameterized cluster editing problems
• A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing
• Reflections on Multivariate Algorithmics and Problem Parameterization
• The Cluster Editing Problem: Implementations and Experiments
• Exact Algorithms for Cluster Editing: Evaluation and Experiments
• A 2k Kernel for the Cluster Editing Problem
• Graph-Based Data Clustering with Overlaps
• Efficient Parameterized Preprocessing for Cluster Editing

This page was built for publication: Alternative Parameterizations for Cluster Editing