A new temporal interpretation of cluster editing
From MaRDI portal
(Redirected from Publication:6564624)
Cites work
- 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
- A 2k kernel for the cluster editing problem
- A golden ratio parameterized algorithm for cluster editing
- A new temporal interpretation of cluster editing
- Aggregating inconsistent information: ranking and clustering
- Cluster editing
- Cluster Editing in Multi-Layer and Temporal Graphs.
- Cluster editing problem for points on the real line: a polynomial time algorithm
- Cluster editing with locally bounded modifications
- Cluster editing: kernelization based on edge cuts
- Cluster graph modification problems
- Coloring temporal graphs
- Computing maximal cliques in link streams
- Computing maximum matchings in temporal graphs.
- Correlation clustering
- Feedback edge sets in temporal graphs
- Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
- NP-hard problems in hierarchical-tree clustering
- On best transitive approximations to simple graphs
- On the complexity of multi-parameterized cluster editing
- Parameterized dynamic cluster editing
- Sliding window temporal graph coloring
- Temporal cliques admit sparse spanners
- Temporal cliques admit sparse spanners
- 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 Multi-parameterized Cluster Editing Problem
- The PACE 2021 parameterized algorithms and computational experiments challenge: cluster editing
- The temporal explorer who returns to the base
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
This page was built for publication: A new temporal interpretation of cluster editing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564624)
