An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion

DOI10.1016/j.tcs.2023.113864arXiv2107.01133OpenAlexW3178869403MaRDI QIDQ6038703

Norma Makarem, Faisal N. Abu-Khzam, Maryam Shehab

Publication date: 2 May 2023

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

Full work available at URL: https://arxiv.org/abs/2107.01133

zbMATH Keywords

cluster editingfixed-parameter tractabilitycorrelation clustering2-club cluster edge deletion

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (3)

Algorithms for 2-club cluster deletion problems using automated generation of branching rules ⋮ On the parameterized complexity of s-club cluster deletion problems ⋮ On the parameterized complexity of \(s\)-club cluster deletion problems

Cites Work

• Exact algorithms for cluster editing: Evaluation and experiments
• Cluster editing with locally bounded modifications
• Fixed-parameter algorithms for cluster vertex deletion
• A more effective linear kernelization for cluster editing
• Cluster editing with vertex splitting
• Automated generation of search tree algorithms for hard graphs modification problems
• Cluster graph modification problems
• Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule?
• Managing and mining graph data
• On the complexity of multi-parameterized cluster editing
• On 2-clubs in graph-based data clustering: theory and algorithm engineering
• On Editing Graphs into 2-Club Clusters
• Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs
• The Cluster Editing Problem: Implementations and Experiments
• Cluster Editing
• Unnamed Item

This page was built for publication: An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion