A new temporal interpretation of cluster editing

DOI10.1007/978-3-031-06678-8_16MaRDI QIDQ2169957zbMATH OpenOpenAlexFDO

Authors Cristiano Bocci, Chiara Capresi, Kitty Meeks, John Sylvester

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

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

Cites work

• A 2k kernel for the cluster editing problem
• A golden ratio parameterized algorithm for cluster editing
• 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
• Computing maximal cliques in link streams
• Computing maximum matchings in temporal graphs.
• Correlation clustering
• NP-hard problems in hierarchical-tree clustering
• On best transitive approximations to simple graphs
• Parameterized algorithms
• Parameterized dynamic cluster editing
• The Multi-parameterized Cluster Editing Problem
• Tight bounds for parameterized complexity of cluster editing with a small number of clusters

Cited in

(4)

• A survey of parameterized algorithms and the complexity of edge modification
• A New Temporal Interpretation of Cluster Editing
• A new temporal interpretation of cluster editing
• Cluster editing for multi-layer and temporal graphs

Describes a project that uses

Uses Software

• cliques

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 Q2169957)