Sufficient conditions for edit-optimal clusters

DOI10.1016/J.IPL.2015.12.004MaRDI QIDQ903364zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

graph algorithmsdegree sequenceoptimality criteriacluster editing

Mathematics Subject Classification ID

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

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

Cites work

• A \(2k\) kernel for the cluster editing problem
• A golden ratio parameterized algorithm for cluster editing
• Cluster editing with locally bounded modifications
• Cluster editing: kernelization based on edge cuts
• 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

Cited in

(3)

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

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)