Cluster Editing in Multi-Layer and Temporal Graphs.
From MaRDI portal
Recommendations
Cites work
- An introduction to temporal graphs: an algorithmic perspective
- Average parameterization and partial kernelization for computing medians
- Cluster editing
- Cluster editing with locally bounded modifications
- Cluster editing: kernelization based on edge cuts
- 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
- Graph-modeled data clustering: Exact algorithms for clique generation
- On the parameterized complexity of consensus clustering
- Parameterized algorithms
- Parameterized and Exact Computation
- Temporal clustering
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
Cited in
(12)- The complexity of finding small separators in temporal graphs
- A new temporal interpretation of cluster editing
- Parameterized dynamic cluster editing
- Optimizing reachability sets in temporal graphs by delaying
- On Editing Graphs into 2-Club Clusters
- A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
- A survey of parameterized algorithms and the complexity of edge modification
- A new temporal interpretation of cluster editing
- Cluster editing for multi-layer and temporal graphs
- Applying a cut-based data reduction rule for weighted cluster editing in polynomial time
- The complexity of transitively orienting temporal graphs
- Multistage graph problems on a global budget
This page was built for publication: Cluster Editing in Multi-Layer and Temporal Graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091014)
