Cluster editing with overlapping communities

DOI10.4230/LIPICS.IPEC.2023.2MaRDI QIDQ6926208zbMATH OpenFDO

Authors Matthias Bentert, Pål Grønås Drange, Blair D. Sullivan, Petra Wolf

Publication date 24 September 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.IPEC.2023.2

zbMATH Keywords

correlation clusteringgraph modificationNP-hardnessparameterized algorithmvertex splitting

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parameterized complexity, tractability and kernelization (68Q27) Algorithms in computer science (68Wxx)

Cites work

• A more effective linear kernelization for cluster editing
• A simple and improved parameterized algorithm for bicluster editing
• A simplified NP-complete satisfiability problem
• Alternative parameterizations for cluster editing
• An FPT algorithm for bipartite vertex splitting
• Cluster editing with locally bounded modifications
• Cluster editing with vertex splitting
• Fast biclustering by dual parameterization
• Faster parameterized algorithm for Bicluster Editing
• Fixed-parameter algorithms for cluster vertex deletion
• Fixed-parameter tractability of graph modification problems for hereditary properties
• Graph clustering
• Graph theory
• Graph-Based Data Clustering with Overlaps
• Improved Algorithms for Bicluster Editing
• Parameterized algorithms
• Parameterized Complexity of Vertex Splitting to Pathwidth at Most 1
• Parametrized complexity theory.
• Phylogenetic k-root and Steiner k-root
• Planarizing graphs and their drawings by vertex splitting
• Subexponential algorithm for d-cluster edge deletion: exception or rule?
• Which problems have strongly exponential complexity?

Cited in

(3)

• Cluster editing with vertex splitting
• On the complexity of establishing hereditary graph properties via vertex splitting
• Cluster editing on cographs and related classes

This page was built for publication: Cluster editing with overlapping communities

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