Cluster Editing in Multi-Layer and Temporal Graphs.
From MaRDI portal
Publication:5091014
DOI10.4230/LIPICS.ISAAC.2018.24OpenAlexW2903724556MaRDI QIDQ5091014FDOQ5091014
Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondřej Suchý
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1709.09100
fixed-parameter algorithmsparameterized complexitypolynomial kernelscluster editingtemporal graphsmulti-layer graphs
Cites Work
- Title not available (Why is that?)
- Enumerating maximal cliques in link streams with durations
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- Cluster Editing
- Correlation clustering
- Cluster editing with locally bounded modifications
- Parameterized Algorithms
- Average parameterization and partial kernelization for computing medians
- Parameterized and Exact Computation
- On the parameterized complexity of consensus clustering
- Graph-modeled data clustering: Exact algorithms for clique generation
- Cluster editing: kernelization based on edge cuts
- Dual Connectedness of Edge-Bicolored Graphs and Beyond
- An Introduction to Temporal Graphs: An Algorithmic Perspective*
- Ensemble-based community detection in multilayer networks
Cited In (10)
- Multistage graph problems on a global budget
- A new temporal interpretation of cluster editing
- Parameterized dynamic cluster editing
- On Editing Graphs into 2-Club Clusters
- A survey of parameterized algorithms and the complexity of edge modification
- Cluster editing for multi-layer and temporal graphs
- A new temporal interpretation of cluster editing
- A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
- Optimizing reachability sets in temporal graphs by delaying
- The complexity of finding small separators in temporal graphs
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)
