Cluster Editing in Multi-Layer and Temporal Graphs.
From MaRDI portal
Publication:5091014
DOI10.4230/LIPIcs.ISAAC.2018.24OpenAlexW2903724556MaRDI QIDQ5091014
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 algorithmscluster editingparameterized complexitypolynomial kernelstemporal graphsmulti-layer graphs
Related Items (6)
Multistage graph problems on a global budget ⋮ A new temporal interpretation of cluster editing ⋮ Optimizing reachability sets in temporal graphs by delaying ⋮ A survey of parameterized algorithms and the complexity of edge modification ⋮ Parameterized dynamic cluster editing ⋮ The complexity of finding small separators in temporal graphs
Cites Work
- Unnamed Item
- 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
- Enumerating maximal cliques in link streams with durations
- Ensemble-based community detection in multilayer networks
- Cluster editing: kernelization based on edge cuts
- On the parameterized complexity of consensus clustering
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- Dual Connectedness of Edge-Bicolored Graphs and Beyond
- Parameterized and Exact Computation
- Cluster Editing
- Parameterized Algorithms
- An Introduction to Temporal Graphs: An Algorithmic Perspective*
This page was built for publication: Cluster Editing in Multi-Layer and Temporal Graphs.
