Parameter testing with bounded degree graphs of subexponential growth

Details Parameter testing with bounded degree graphs of subexponential growth Parameter testing with bounded degree graphs of subexponential growth

2007-11-18

arxiv.org/abs/0711.2800v3

Mathematics

Combinatorics

To appear in Random Structures and Algorithms. (note that the title has changed)

Scientific paper

Parameter testing algorithms are using constant number of queries to estimate the value of a certain parameter of a very large finite graph. It is well-known that graph parameters such as the independence ratio or the edit-distance from 3-colorability are not testable in bounded degree graphs. We prove, however, that these and several other interesting graph parameters are testable in bounded degree graphs of subexponential growth.

Affiliated with

Also associated with

No associations

Rating

Parameter testing with bounded degree graphs of subexponential growth 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 Parameter testing with bounded degree graphs of subexponential growth, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parameter testing with bounded degree graphs of subexponential growth will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-297690