The Multi-parameterized Cluster Editing Problem

DOI10.1007/978-3-319-03780-6_25MaRDI QIDQ2867127zbMATH OpenOpenAlexFDO

Authors 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

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On the complexity of multi-parameterized cluster editing
• The Cluster Editing Problem: Implementations and Experiments
• Applying modular decomposition to parameterized cluster editing problems
• Fixed-Parameter Tractable Generalizations of Cluster Editing
• Tight bounds for parameterized complexity of Cluster Editing
• Parameterized algorithms for min-max 2-cluster editing
• Tight bounds for parameterized complexity of cluster editing with a small number of clusters
• Exact algorithms for cluster editing: Evaluation and experiments
• Exact Algorithms for Cluster Editing: Evaluation and Experiments
• A \(2k\) kernel for the cluster editing problem

Cites work

• A \(2k\) kernel for the cluster editing problem
• A golden ratio parameterized algorithm for cluster editing
• A more effective linear kernelization for cluster editing
• Cluster editing with locally bounded modifications
• Cluster editing: kernelization based on edge cuts
• Cluster graph modification problems
• Exact algorithms for cluster editing: Evaluation and experiments
• Exact algorithms for edge domination
• Fixed-parameter tractability of graph modification problems for hereditary properties
• 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

Cited in

(14)

• A new temporal interpretation of cluster editing
• Parameterized dynamic cluster editing
• On the complexity of multi-parameterized cluster editing
• Tight bounds for parameterized complexity of cluster editing with a small number of clusters
• Tight bounds for parameterized complexity of Cluster Editing
• A PTAS for the Cluster Editing Problem on Planar Graphs
• Alternative parameterizations for cluster editing
• Branch-and-cut approaches for p-cluster editing
• Parameterized Dynamic Cluster Editing
• Cluster Editing in Multi-Layer and Temporal Graphs.
• Graph-Theoretic Concepts in Computer Science
• Efficient algorithms for cluster editing
• Editing to cliques: a survey of FPT results and recent applications in analyzing large datasets
• A new temporal interpretation of cluster editing

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867127)