Cluster editing for multi-layer and temporal graphs
type: Item
instance of: scholarly article
title: Cluster editing for multi-layer and temporal graphs
author: Jiehua Chen
author: Hendrik Molter
author: Manuel Sorge
author: Ondřej Suchý
published in: Theory of Computing Systems
publication date: 2024-11-12T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
Mathematics Subject Classification ID: 05Cxx
Mathematics Subject Classification ID: 68Rxx
zbMATH DE Number: 7941439
zbMATH Keywords: time-varying graphs
zbMATH Keywords: link streams
zbMATH Keywords: parameterized complexity analysis
zbMATH Keywords: clustering
MaRDI profile type: Publication
cites work: Cluster Editing in Multi-Layer and Temporal Graphs.
cites work: Cluster graph modification problems
cites work: Correlation clustering
cites work: Cluster Editing
cites work: Graph-modeled data clustering: Exact algorithms for clique generation
cites work: Cluster editing: kernelization based on edge cuts
cites work: Tight bounds for parameterized complexity of cluster editing with a small number of clusters
cites work: Cluster editing with locally bounded modifications
cites work: Parameterized dynamic cluster editing
cites work: Parameterizing edge modification problems above lower bounds
cites work: Q6192494
cites work: Ensemble-based community detection in multilayer networks
cites work: A new temporal interpretation of cluster editing
cites work: Multistage graph problems on a global budget
cites work: Dual Connectedness of Edge-Bicolored Graphs and Beyond
cites work: Combining clickstream analyses and graph-modeled data clustering for identifying common response processes
cites work: Enumerating maximal cliques in link streams with durations
cites work: An Introduction to Temporal Graphs: An Algorithmic Perspective*
cites work: Multistage vertex cover
cites work: Q5116470
cites work: Fundamentals of parameterized complexity
cites work: Parametrized complexity theory.
cites work: Q5710169
cites work: Parameterized Algorithms
cites work: A golden ratio parameterized algorithm for cluster editing
cites work: A \(2k\) kernel for the cluster editing problem
cites work: Parameterized and Exact Computation
cites work: Computing maximal cliques in link streams
cites work: Temporal graph classes: a view through temporal separators
cites work: The complexity of finding small separators in temporal graphs
cites work: Connectivity and inference problems for temporal networks
cites work: Finding temporal paths under waiting time constraints
cites work: Sliding window temporal graph coloring
cites work: Temporal vertex cover with a sliding time window
cites work: Computing maximum matchings in temporal graphs.
cites work: Temporal matching
cites work: Simultaneous Feedback Vertex Set
cites work: Temporal network optimization subject to connectivity constraints
cites work: Q5092344
cites work: Temporal Cliques Admit Sparse Spanners
cites work: Changing Bases: Multistage Optimization for Matroids and Matchings
cites work: Approximating multistage matching problems
cites work: Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs
cites work: Multistage knapsack
cites work: LP-based algorithms for multistage minimization problems
cites work: A multistage view on 2-satisfiability
cites work: Parameterized Algorithms for Diverse Multistage Problems
cites work: Average parameterization and partial kernelization for computing medians
cites work: On the parameterized complexity of consensus clustering
cites work: Q5111721
cites work: NP-hard problems in hierarchical-tree clustering
cites work: Q5519710
cites work: Combinatorial voter control in elections
cites work: Fixed-parameter tractability of graph modification problems for hereditary properties
cites work: On the parameterized complexity of multiple-interval graph problems
cites work: Kernelization Lower Bounds by Cross-Composition
DOI: 10.1007/S00224-024-10174-Y
description: scientific article; zbMATH DE number 7941439