The Multi-parameterized Cluster Editing Problem

DOI10.1007/978-3-319-03780-6_25zbMath1406.68035OpenAlexW192351423MaRDI QIDQ2867127

Faisal N. Abu-Khzam

Publication date: 10 December 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-319-03780-6_25

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)

Related Items (3)

A new temporal interpretation of cluster editing ⋮ On the complexity of multi-parameterized cluster editing ⋮ Branch-and-cut approaches for \(p\)-cluster editing

Cites Work

• Unnamed Item
• Exact algorithms for cluster editing: Evaluation and experiments
• Cluster editing with locally bounded modifications
• Graph-modeled data clustering: Exact algorithms for clique generation
• A more effective linear kernelization for cluster editing
• Going weighted: parameterized algorithms for cluster editing
• NP-hard problems in hierarchical-tree clustering
• Fixed-parameter tractability of graph modification problems for hereditary properties
• Cluster editing: kernelization based on edge cuts
• Cluster graph modification problems
• Exact algorithms for edge domination
• A Golden Ratio Parameterized Algorithm for Cluster Editing
• A 2k Kernel for the Cluster Editing Problem

This page was built for publication: The Multi-parameterized Cluster Editing Problem