Clustering to Given Connectivities

DOI10.4230/LIPIcs.IPEC.2019.18OpenAlexW2998447595MaRDI QIDQ5875551

Petr A. Golovach, Dimitrios M. Thilikos

Publication date: 3 February 2023

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

zbMATH Keywords

parameterized complexitygraph clusteringedge connectivity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (1)

A survey of parameterized algorithms and the complexity of edge modification

This page was built for publication: Clustering to Given Connectivities