Parameter testing in bounded degree graphs of subexponential growth
نویسنده
چکیده
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. AMS Subject Classifications: 05C99
منابع مشابه
A Regularity Lemma for Bounded Degree Graphs and Its Applications: Parameter Testing and Infinite Volume Limits
We prove a regularity lemma for bounded degree graphs of subexponential growth. As an application we show that the edit-distance from a hereditary property is testable via random samplings in the graph category above. Using the regularity lemma we also prove the existence of the infinite volume limit of some log-partition functions as well as the nonrandomness of the integrated density of state...
متن کاملGenus characterizes the complexity of certain graph problems: Some tight results
We study the fixed-parameter tractability, subexponential time computability, and approximability of the well-known NP-hard problems: INDEPENDENT SET, VERTEX COVER, and DOMINATING SET. We derive tight results and show that the computational complexity of these problems, with respect to the above complexity measures, is dependent on the genus of the underlying graph. For instance, we show that, ...
متن کاملSubexponential Parameterized Algorithms for Graphs of Polynomial Growth
We show that for a number of parameterized problems for which only 2O(k)nO(1) time algorithms are known on general graphs, subexponential parameterized algorithms with running time 2O(k 1− 1 1+δ log2 k)nO(1) are possible for graphs of polynomial growth with growth rate (degree) δ, that is, if we assume that every ball of radius r contains only O(r) vertices. The algorithms use the technique of ...
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملLight Structures in Infinite Planar Graphs without the Strong Isoperimetric Property
It is shown that the discharging method can be successfully applied on infinite planar graphs of subexponential growth and even on those graphs that do not satisfy the strong edge isoperimetric inequality. The general outline of the method is presented and the following applications are given: Planar graphs with only finitely many vertices of degree ≤ 5 and with subexponential growth contain ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Random Struct. Algorithms
دوره 37 شماره
صفحات -
تاریخ انتشار 2010