Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Statistics
  • Help & Advice
University of Warwick

The Library

  • Login

Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs

Tools
- Tools
+ Tools

Czumaj, Artur, Shapira, A. and Sohler, C.. (2009) Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs. SIAM Journal on Computing (SICOMP), 38 (6). pp. 2499-2510. ISSN 0097-5397

Full text not available from this repository.
Official URL: http://dx.doi.org/10.1137/070681831

Abstract

We study graph properties that are testable for bounded-degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined graph property and graphs that are far from every graph having that property. It is well known that in the bounded-degree graph model (where two graphs are considered “far” if they differ in $\varepsilon n$ edges for a positive constant $\varepsilon$), many graph properties cannot be tested even with a constant or even with a polylogarithmic number of queries. Therefore in this paper we focus our attention on testing graph properties for special classes of graphs. Specifically, we show that every hereditary graph property is testable with a constant number of queries provided that every sufficiently large induced subgraph of the input graph has poor expansion. This result implies that, for example, any hereditary property (e.g., $k$-colorability, $H$-freeness, etc.) is testable in the bounded-degree graph model for planar graphs, graphs with bounded genus, interval graphs, etc. No such results have been known before, and prior to our work, very few graph properties have been known to be testable with a constant number of queries for general graph classes in the bounded-degree graph model.

Item Type: Journal Article
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions: Faculty of Science > Computer Science
Journal or Publication Title: SIAM Journal on Computing (SICOMP)
Publisher: Society for Industrial and Applied Mathematics
ISSN: 0097-5397
Date: 2009
Volume: 38
Number: 6
Page Range: pp. 2499-2510
Identification Number: 10.1137/070681831
Publication Status: Published
Related URLs:
  • Other Repository
URI: http://wrap.warwick.ac.uk/id/eprint/47507

Request changes to a record

Actions (login required)

View Item View Item
twitter

Email us: publications@warwick.ac.uk
Contact Details
About Us