Property Testing of the Diameter of a Graph TAU图头直径的属性检验.pptVIP

Testing the Diameter of Graphs Michal Parnas Dana Ron Property Testing of Graphs Previous Representations of Graphs Our Model A Testing Algorithm The Diameter Problem Our Results Related Work Algorithm Illustration of the Algorithm Proof of Correctness Reducing the Diameter Proof of Item 1 Proof of Item 2 Item 2 - Continued Proof of Lemma 3 Tree Lemma (Special Case) Tree Lemma ? -far Range of ? Reducing the Diameter of a Graph Our Results * Let G = (V,E) be an undirected graph. A Testing Algorithm of property P: The algorithm can query on the incidence relations of vertices in G. If G has property P: Accept. If G is “far” from P: Reject. Adjacency Matrix [GGR]. Queries: Is (u,v) ? E. ? -far: ??n2 edges should be modified. Dense graphs. Incidence Lists of bounded length d [GR]. Queries: Who is i’th neighbor of v? ? -far: ??d?n edges should be modified.  Sparse bounded degree graphs. 1 1 1 1 0 0 0 0 0 1 n 1 n 1 2 … d 1 2 … d 1 n G = (V,E) an undirected graph, |V| = n, |E| ? m. Representation: Incidence lists of varying length. Queries: Who is i’th neighbor of v? ? -far: ??m edge modifications. 1 n A testing algorithm for a parameterized property Ps is given: Distance parameter 0 ? 1. Query access to a graph G having at most m edges. Boundary function ?(?). The algorithm: Should accept with probability at least 2/3,  if G has property Ps. Should reject with probability at least 2/3, if G is ? -far from property . Ps ? Accept Reject Question: Is the diameter of G at most D or is it ?-far from diameter ?(D)? The algorithms differ in: The boundary function ?(?). The query and time complexities. The feasible values of ?. Time and Query Complexity: 1. 2. Testing Algebraic Properties (Linearity and Low degree) Program Testing: Blum Luby Rubinfeld, Rubinfeld, Rubinfeld Sudan ... PCP: Babai Fortnow Lund, Babai F