This paper proves that for every positive integers n,k and any positive constant ε, we can explicitly construct a graph G with n+ O(k1+ε) vertices and a constant degree such that even after removing any k vertices from G, the remaining graph still contains an n-vertex dipath. This paper also proves that for every positive integers n, k and any positive constant ε, we can explicitly construct a graph H with n+O(k2+ε) 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. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Yamada, T. (2004). Fault-tolerant meshes with constant degree. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3106, 402–411. https://doi.org/10.1007/978-3-540-27798-9_43
Mendeley helps you to discover research relevant for your work.