Parameterized dynamic cluster editing
type: Item
instance of: scholarly article
title: Parameterized dynamic cluster editing
author: Hendrik Molter
author: André Nichterlein
author: Jun-Jie Luo
author: Rolf Niedermeier
published in: Algorithmica
publication date: 2021-02-01T00:00:00Z
full work available at URL: https://arxiv.org/abs/1810.06625
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q27
zbMATH DE Number: 7303842
zbMATH Keywords: graph-based data clustering
zbMATH Keywords: incremental clustering
zbMATH Keywords: compromise clustering
zbMATH Keywords: correlation clustering
zbMATH Keywords: local search
zbMATH Keywords: goal-oriented clustering
zbMATH Keywords: \textsf{NP}-hard problems
zbMATH Keywords: fixed-parameter tractability
zbMATH Keywords: parameterized complexity
zbMATH Keywords: kernelization
zbMATH Keywords: multi-choice knapsack
MaRDI profile type: Publication
OpenAlex ID: W3044843373
cites work: On the complexity of multi-parameterized cluster editing
cites work: On the parameterized complexity of dynamic problems
cites work: Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis
cites work: Cluster editing with vertex splitting
cites work: Correlation clustering
cites work: On the Hardness of Reoptimization
cites work: Cluster Editing
cites work: Cluster editing: kernelization based on edge cuts
cites work: Incremental Clustering and Dynamic Information Retrieval
cites work: A \(2k\) kernel for the cluster editing problem
cites work: Cluster Editing in Multi-Layer and Temporal Graphs.
cites work: Parameterized Algorithms
cites work: Q5111721
cites work: Clustering With Multi-Layer Graphs: A Spectral Perspective
cites work: Fundamentals of parameterized complexity
cites work: Q5074183
cites work: On the parameterized complexity of multiple-interval graph problems
cites work: Local search: is brute-force avoidable?
cites work: Parametrized complexity theory.
cites work: Tight bounds for parameterized complexity of cluster editing with a small number of clusters
cites work: Q4198056
cites work: Graph-modeled data clustering: Exact algorithms for clique generation
cites work: A more effective linear kernelization for cluster editing
cites work: The parameterized complexity of local search for TSP, more refined
cites work: Incremental list coloring of graphs, parameterized by conservation
cites work: Reducibility among Combinatorial Problems
cites work: Q4821303
cites work: Cluster editing with locally bounded modifications
cites work: Dynamic parameterized problems
cites work: Parameterized Dynamic Cluster Editing
cites work: Parameterized complexity and local search approaches for the stable marriage problem with ties
cites work: Local equivalences of distances between clusterings -- a geometric perspective
cites work: Q5710169
cites work: A theory and algorithms for combinatorial reoptimization
cites work: Cluster graph modification problems
DOI: 10.1007/S00453-020-00746-Y
description: scientific article