Work

Testability of minimum balanced multiway cut densities

Year: 2010

Type: preprint

Abstract: Testable weighted graph parameters and equivalent notions of testability are investigated based on papers of Laszlo Lovasz and coauthors. We prove that certain balanced minimum multiway cut densities are testable. Using this fact, quadratic programming techniques are applied to approximate some of these quantities. The problem is related to cluster analysis and statistical physics. Convergence of special noisy graph sequences is also discussed.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1001.1623

Authors: Bolla, Marianna, Koi, Tamas, Kramli, Andras

Institutions: Budapest University of Technology and Economics, University of Szeged

Language: English

Topic: Limits and Structures in Graph Theory

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: green

Funders: Hungarian Scientific Research Fund, Nemzeti Kutatási és Technológiai Hivatal

OpenAlex ID: W2952864455

Cites: 4

Cited by: 1

Related to: 20