A heuristic algorithm for the cluster editing problem

DOI10.1007/S10589-025-00725-5MaRDI QIDQ6872931zbMATH OpenFDO

Authors Keisuke Murakami, Takeaki Uno

Publication date 19 January 2026

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10589-025-00725-5

zbMATH Keywords

optimizationmeta-heuristicslocal search algorithmcluster editing problem

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites work

• scientific article; zbMATH DE number 7803609 (Why is no real title available?)
• A 2k kernel for the cluster editing problem
• A more effective linear kernelization for cluster editing
• Cluster editing with locally bounded modifications
• Cluster graph modification problems
• Clustering with qualitative information
• Efficient algorithms for cluster editing
• Exact algorithms for cluster editing: Evaluation and experiments
• Fast unfolding of communities in large networks
• Fixed-parameter enumerability of cluster editing and related problems
• Graph-based data clustering with overlaps
• Graph-modeled data clustering: Exact algorithms for clique generation
• Random Graphs
• The Cluster Editing Problem: Implementations and Experiments

This page was built for publication: A heuristic algorithm for the cluster editing problem

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