Parameterized Dynamic Cluster Editing
From MaRDI portal
Publication:5090987
DOI10.4230/LIPIcs.FSTTCS.2018.46OpenAlexW2895851246MaRDI QIDQ5090987
Rolf Niedermeier, Hendrik Molter, André Nichterlein, 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
NP-hard problemsfixed-parameter tractabilityparameterized hardnesscompromise clusteringgoal-oriented clusteringgraph-based data clustering
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The parameterized complexity of local search for TSP, more refined
- Incremental list coloring of graphs, parameterized by conservation
- A \(2k\) kernel for the cluster editing problem
- Local equivalences of distances between clusterings -- a geometric perspective
- Local search: is brute-force avoidable?
- Correlation clustering
- Cluster editing with locally bounded modifications
- Dynamic parameterized problems
- Graph-modeled data clustering: Exact algorithms for clique generation
- On the parameterized complexity of dynamic problems
- Cluster editing with vertex splitting
- A theory and algorithms for combinatorial reoptimization
- Cluster editing: kernelization based on edge cuts
- Cluster graph modification problems
- Parameterized complexity and local search approaches for the stable marriage problem with ties
- On the complexity of multi-parameterized cluster editing
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis
- Clustering With Multi-Layer Graphs: A Spectral Perspective
- Incremental Clustering and Dynamic Information Retrieval
- Cluster Editing
- On the Hardness of Reoptimization
- Parameterized Algorithms
