Parameterized Dynamic Cluster Editing
DOI10.4230/LIPICS.FSTTCS.2018.46OpenAlexW2895851246MaRDI QIDQ5090987FDOQ5090987
Authors: Hendrik Molter, André Nichterlein, Rolf Niedermeier, Jun-Jie Luo 
Publication date: 21 July 2022
Full work available at URL: https://depositonce.tu-berlin.de/bitstream/11303/12837/1/Luo_etal_Parameterized_2021.pdf
Recommendations
- Parameterized dynamic cluster editing
- Alternative parameterizations for cluster editing
- Efficient Parameterized Preprocessing for Cluster Editing
- Cluster editing
- The Multi-parameterized Cluster Editing Problem
- Cluster editing with locally bounded modifications
- On the complexity of multi-parameterized cluster editing
- Fixed-Parameter Tractable Generalizations of Cluster Editing
- Even faster parameterized cluster deletion and cluster editing
- Efficient algorithms for cluster editing
fixed-parameter tractabilityNP-hard problemsparameterized hardnesscompromise clusteringgoal-oriented clusteringgraph-based data clustering
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)
Cites Work
- Title not available (Why is that?)
- Local equivalences of distances between clusterings -- a geometric perspective
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- A \(2k\) kernel for the cluster editing problem
- Cluster editing
- Correlation clustering
- Cluster editing with locally bounded modifications
- Parameterized Algorithms
- Incremental list coloring of graphs, parameterized by conservation
- Title not available (Why is that?)
- On the Hardness of Reoptimization
- Cluster graph modification problems
- The parameterized complexity of local search for TSP, more refined
- Local search: is brute-force avoidable?
- Incremental Clustering and Dynamic Information Retrieval
- Graph-modeled data clustering: Exact algorithms for clique generation
- Parameterized complexity and local search approaches for the stable marriage problem with ties
- Cluster editing: kernelization based on edge cuts
- Clustering With Multi-Layer Graphs: A Spectral Perspective
- Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis
- Dynamic parameterized problems
- On the parameterized complexity of dynamic problems
- A theory and algorithms for combinatorial reoptimization
- Cluster editing with vertex splitting
- On the complexity of multi-parameterized cluster editing
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: Parameterized Dynamic Cluster Editing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090987)
