Graph Clustering in All Parameter Regimes

DOI10.4230/LIPIcs.MFCS.2020.39OpenAlexW3082501155MaRDI QIDQ5089206

David F. Gleich, Junhao Gan, Nate Veldt, Anthony Wirth, Xin Zhang

Publication date: 18 July 2022

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

zbMATH Keywords

algorithmsgraph clusteringparametric linear programming

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Correlation clustering
• Cluster graph modification problems
• Correlation clustering in general weighted graphs
• Clustering with qualitative information
• Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
• Complexity of some parametric integer and network programming problems
• Computational complexity of parametric linear programming
• Metric-Constrained Optimization for Graph Clustering Algorithms
• Integer Programming and Combinatorial Optimization
• Unnamed Item

This page was built for publication: Graph Clustering in All Parameter Regimes