Testability of minimum balanced multiway cut densities

Authors:
Marianna Bolla;Tamás Kói;András Krámli
Affiliations:
Institute of Mathematics, Budapest University of Technology and Economics, Hungary;Institute of Mathematics, Budapest University of Technology and Economics, Hungary;Bolyai Institute, University of Szeged, Hungary
Venue:
Discrete Applied Mathematics
Year:
2012

Citing 6
Cited 1

Polynomial time approximation schemes for dense instances of NP-hard problems

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Property testing and its connection to learning and approximation

Journal of the ACM (JACM)
Spectral Partitioning of Random Graphs

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Graph limits and parameter testing

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Limits of dense graph sequences

Journal of Combinatorial Theory Series B
Generalized quasirandom graphs

Journal of Combinatorial Theory Series B

Modularity spectra, eigen-subspaces, and structure of weighted graphs

European Journal of Combinatorics

Quantified Score

Hi-index	0.04

Visualization

Abstract

Testability of certain balanced minimum multiway cut densities is investigated for vertex- and edge-weighted graphs with no dominant vertex-weights. We apply the results for fuzzy clustering and noisy graph sequences.