Random local algorithms

Details Random local algorithms Random local algorithms

2012-02-07

arxiv.org/abs/1202.1565v2

Mathematics

Combinatorics

9 pages

Scientific paper

Consider the problem when we want to construct some structure on a bounded degree graph, e.g. an almost maximum matching, and we want to decide about each edge depending only on its constant radius neighbourhood. We show that the information about the local statistics of the graph does not help here. Namely, if there exists a random local algorithm which can use any local statistics about the graph, and produces an almost optimal structure, then the same can be achieved by a random local algorithm using no statistics.

Affiliated with

Also associated with

No associations

Rating

Random local algorithms 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 Random local algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random local algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-63779