Clustering to Given Connectivities

DOI10.4230/LIPICS.IPEC.2019.18MaRDI QIDQ5875551zbMATH OpenOpenAlexFDO

Authors Petr A. Golovach, Dimitrios M. Thilikos

Publication date 3 February 2023

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

zbMATH Keywords

edge connectivitygraph clusteringparameterized complexity

Mathematics Subject Classification ID

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

Cited in

(8)

• A Local Clustering Algorithm for Connection Graphs
• Correlation clustering on networks
• Ranking inter-relationships between clusters
• scientific article; zbMATH DE number 7371757 (Why is no real title available?)
• Clustering Cycles into Cycles of Clusters
• A survey of parameterized algorithms and the complexity of edge modification
• On the parameterized complexity of multiway near-separator
• Finding clique clusters with the highest betweenness centrality

This page was built for publication: Clustering to Given Connectivities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875551)