Abstract
AbstractParameter 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. © 2010 Wiley Periodicals, Inc. Random Struct. Alg., 2010
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
