Graph Clustering in All Parameter Regimes

DOI10.4230/LIPICS.MFCS.2020.39MaRDI QIDQ5089206zbMATH OpenOpenAlexFDO

Authors Junhao Gan, David F. Gleich, 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

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

Cited in

(7)

• Limitations on regularity lemmas for clustering graphs
• scientific article; zbMATH DE number 5320278 (Why is no real title available?)
• scientific article; zbMATH DE number 1305418 (Why is no real title available?)
• Graph clustering
• Graph Clustering using Effective Resistance
• Robust Clustering Oracle and Local Reconstructor of Cluster Structure of Graphs
• scientific article; zbMATH DE number 6781370 (Why is no real title available?)

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

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