Fault-tolerant meshes with constant degree
This paper proves that for every positive integers n,k and any positive number epsilon, we can explicitly construct a DAG G with n+O(k(1+epsilon)) vertices and a constant degree such that even after removing any k vertices from G, the remaining digraph still contains an n-vertex dipath. This paper also proves that for every positive integers n, k and any positive number epsilon, we can explicitly construct a graph H with n + O(k(2+epsilon)) vertices and a constant degree such that even after removing any k vertices from H, the remaining graph still contains an n-vertex 2-dimensional square mesh. key words: fault-tolerant graph, dipath, mesh, tower graph, constant degree
mesh constant degree dipath fault-tolerant graph tower graph