Testability of minimum balanced multiway cut densities

DOI10.1016/j.dam.2011.12.005zbMath1239.05084arXiv1001.1623OpenAlexW2161720717MaRDI QIDQ423907

András Krámli, Tamás Kói, Marianna Bolla

Publication date: 30 May 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

fuzzy clusteringminimum balanced multiway cutstestable weighted graph parametersWigner-noise

Mathematics Subject Classification ID

Signed and weighted graphs (05C22)

Related Items (2)

Modularity spectra, eigen-subspaces, and structure of weighted graphs ⋮ Generalized quasirandom properties of expanding graph sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Recognizing linear structure in noisy matrices
• Limits of dense graph sequences
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• Quick approximation to matrices and applications
• Generalized quasirandom graphs
• Graph limits and parameter testing
• Property testing and its connection to learning and approximation

This page was built for publication: Testability of minimum balanced multiway cut densities