A new temporal interpretation of cluster editing

DOI10.1007/978-3-031-06678-8_16OpenAlexW4285308311MaRDI QIDQ2169957

Kitty Meeks, John Sylvester, Cristiano Bocci, Chiara Capresi

Publication date: 30 August 2022

Full work available at URL: https://arxiv.org/abs/2202.01103

zbMATH Keywords

cluster editinggraph clusteringparameterised complexitytemporal graphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (1)

A survey of parameterized algorithms and the complexity of edge modification

Uses Software

• cliques

Cites Work

• A \(2k\) kernel for the cluster editing problem
• Correlation clustering
• Cluster editing with locally bounded modifications
• Computing maximal cliques in link streams
• NP-hard problems in hierarchical-tree clustering
• Cluster editing problem for points on the real line: a polynomial time algorithm
• Cluster editing: kernelization based on edge cuts
• On best transitive approximations to simple graphs
• Cluster graph modification problems
• A golden ratio parameterized algorithm for cluster editing
• Parameterized dynamic cluster editing
• Tight bounds for parameterized complexity of cluster editing with a small number of clusters
• The Multi-parameterized Cluster Editing Problem
• Cluster Editing in Multi-Layer and Temporal Graphs.
• Cluster Editing
• Parameterized Algorithms
• Computing maximum matchings in temporal graphs.

This page was built for publication: A new temporal interpretation of cluster editing