Optimal fault-tolerant linear arrays

This paper proves that for every positive integers n and k, we can explicitly construct a graph G with n+O(k) vertices and maximum degree 3, such that even after removing any k vertices from G, the remaining graph still contains a path of

• Type: Conference
• Year: 2003
• Where: SPAA
• Authors: Toshinori Yamada, Shuichi Ueno
• Keywords: Distributed And Parallel Computing, Maximum Degree, Positive Integers, SPAA 2003