Testability of minimum balanced multiway cut densities

Details Testability of minimum balanced multiway cut densities Testability of minimum balanced multiway cut densities

2010-01-11

arxiv.org/abs/1001.1623v1

Mathematics

Probability

24 pages, short version was a contributed paper of the conference: Fete of Combinatorics and Computer Science, Keszthely, Hung

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Testability of minimum balanced multiway cut densities does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Testability of minimum balanced multiway cut densities, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Testability of minimum balanced multiway cut densities will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-719055