Cluster editing for multi-layer and temporal graphs
From MaRDI portal
Publication:6635696
DOI10.1007/s00224-024-10174-yMaRDI QIDQ6635696
Ondřej Suchý, Hendrik Molter, Jiehua Chen, Manuel Sorge
Publication date: 12 November 2024
Published in: Theory of Computing Systems (Search for Journal in Brave)
Theory of computing (68Qxx) Graph theory (05Cxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- A \(2k\) kernel for the cluster editing problem
- Correlation clustering
- Cluster editing with locally bounded modifications
- Average parameterization and partial kernelization for computing medians
- Graph-modeled data clustering: Exact algorithms for clique generation
- Combining clickstream analyses and graph-modeled data clustering for identifying common response processes
- Multistage graph problems on a global budget
- Computing maximal cliques in link streams
- On the parameterized complexity of multiple-interval graph problems
- NP-hard problems in hierarchical-tree clustering
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Parameterizing edge modification problems above lower bounds
- Enumerating maximal cliques in link streams with durations
- Temporal network optimization subject to connectivity constraints
- Ensemble-based community detection in multilayer networks
- Cluster editing: kernelization based on edge cuts
- Cluster graph modification problems
- A golden ratio parameterized algorithm for cluster editing
- Finding temporal paths under waiting time constraints
- The complexity of finding small separators in temporal graphs
- Temporal vertex cover with a sliding time window
- On the parameterized complexity of consensus clustering
- Sliding window temporal graph coloring
- LP-based algorithms for multistage minimization problems
- Multistage knapsack
- Multistage vertex cover
- A new temporal interpretation of cluster editing
- Parameterized dynamic cluster editing
- Temporal matching
- Combinatorial voter control in elections
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- Parametrized complexity theory.
- A multistage view on 2-satisfiability
- Dual Connectedness of Edge-Bicolored Graphs and Beyond
- Kernelization Lower Bounds by Cross-Composition
- Cluster Editing in Multi-Layer and Temporal Graphs.
- Temporal Cliques Admit Sparse Spanners
- Changing Bases: Multistage Optimization for Matroids and Matchings
- Simultaneous Feedback Vertex Set
- Parameterized and Exact Computation
- Cluster Editing
- Parameterized Algorithms
- An Introduction to Temporal Graphs: An Algorithmic Perspective*
- Computing maximum matchings in temporal graphs.
- Connectivity and inference problems for temporal networks
- Temporal graph classes: a view through temporal separators
- Approximating multistage matching problems
- Parameterized Algorithms for Diverse Multistage Problems
- Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs
This page was built for publication: Cluster editing for multi-layer and temporal graphs
