Sufficient conditions for edit-optimal clusters

DOI10.1016/j.ipl.2015.12.004zbMath1348.05201OpenAlexW2197054823MaRDI QIDQ903364

Peter Damaschke

Publication date: 5 January 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2015.12.004

zbMATH Keywords

graph algorithmsdegree sequenceoptimality criteriacluster editing

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex degrees (05C07)

Related Items (2)

On the complexity of multi-parameterized cluster editing ⋮ Parameterized algorithms for min-max 2-cluster editing

Cites Work

• A \(2k\) kernel for the cluster editing problem
• Exact algorithms for cluster editing: Evaluation and experiments
• Cluster editing with locally bounded modifications
• Cluster editing: kernelization based on edge cuts
• Cluster graph modification problems
• A golden ratio parameterized algorithm for cluster editing
• Tight bounds for parameterized complexity of Cluster Editing
• Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters

This page was built for publication: Sufficient conditions for edit-optimal clusters