Sufficient conditions for edit-optimal clusters

DOI10.1016/J.IPL.2015.12.004zbMATH Open1348.05201OpenAlexW2197054823MaRDI QIDQ903364FDOQ903364

Authors: 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

Recommendations

• Cluster editing with locally bounded modifications revisited
• Cluster editing with locally bounded modifications
• Cluster graph modification problems
• scientific article; zbMATH DE number 1953109
• Editing graphs into disjoint unions of dense clusters

zbMATH Keywords

graph algorithmsdegree sequenceoptimality criteriacluster editing

Mathematics Subject Classification ID

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

Cites Work

• A golden ratio parameterized algorithm for cluster editing
• A \(2k\) kernel for the cluster editing problem
• Cluster editing with locally bounded modifications
• Cluster graph modification problems
• Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters
• Exact algorithms for cluster editing: Evaluation and experiments
• Tight bounds for parameterized complexity of Cluster Editing
• Cluster editing: kernelization based on edge cuts

Cited In (3)

• Cluster editing with locally bounded modifications revisited
• On the complexity of multi-parameterized cluster editing
• Parameterized algorithms for min-max 2-cluster editing

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

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