Cluster editing for multi-layer and temporal graphs
From MaRDI portal
(Redirected from Publication:6635696)
Cites work
- A 2k kernel for the cluster editing problem
- A golden ratio parameterized algorithm for cluster editing
- A multistage view on 2-satisfiability
- A new temporal interpretation of cluster editing
- An introduction to temporal graphs: an algorithmic perspective
- Approximating multistage matching problems
- Average parameterization and partial kernelization for computing medians
- Changing bases: multistage optimization for matroids and matchings
- Cluster editing
- Cluster Editing in Multi-Layer and Temporal Graphs.
- Cluster editing with locally bounded modifications
- Cluster editing: kernelization based on edge cuts
- Cluster graph modification problems
- Combinatorial voter control in elections
- Combining clickstream analyses and graph-modeled data clustering for identifying common response processes
- Computing maximal cliques in link streams
- Computing maximum matchings in temporal graphs.
- Connectivity and inference problems for temporal networks
- Correlation clustering
- Dual connectedness of edge-bicolored graphs and beyond
- Ensemble-based community detection in multilayer networks
- Enumerating maximal cliques in link streams with durations
- Finding temporal paths under waiting time constraints
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Fundamentals of parameterized complexity
- Graph-modeled data clustering: Exact algorithms for clique generation
- scientific article; zbMATH DE number 7238962 (Why is no real title available?)
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Kernelization Lower Bounds by Cross-Composition
- LP-based algorithms for multistage minimization problems
- Multistage graph problems on a global budget
- Multistage knapsack
- Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs
- Multistage vertex cover
- NP-hard problems in hierarchical-tree clustering
- On the parameterized complexity of consensus clustering
- On the parameterized complexity of multiple-interval graph problems
- Parameterized algorithms
- Parameterized Algorithms for Diverse Multistage Problems
- Parameterized and Exact Computation
- Parameterized dynamic cluster editing
- Parametrized complexity theory.
- Simultaneous feedback vertex set: a parameterized perspective
- Sliding window temporal graph coloring
- Temporal cliques admit sparse spanners
- Temporal clustering
- Temporal matching
- Temporal network optimization subject to connectivity constraints
- Temporal vertex cover with a sliding time window
- The complexity of finding small separators in temporal graphs
- The PACE 2021 parameterized algorithms and computational experiments challenge: cluster editing
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- Two moves per time step make a difference
Cited in
(1)
This page was built for publication: Cluster editing for multi-layer and temporal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635696)
