| Presentation | 2003/1/17 Explicit Construction of Optimal Fault-Tolerant Linear Arrays Toshinori YAMADA, Shuichi UENO, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | 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 length n - 1. This settles a problem raised by Zhang [12,13] in connection with the design of fault-tolerant linear arrays. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Fault-Tolerant Graph / Linear Array / Magnifier / Expander |
| Paper # | COMP2002-62 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2003/1/17(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Theoretical Foundations of Computing (COMP) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Explicit Construction of Optimal Fault-Tolerant Linear Arrays |
| Sub Title (in English) | |
| Keyword(1) | Fault-Tolerant Graph |
| Keyword(2) | Linear Array |
| Keyword(3) | Magnifier |
| Keyword(4) | Expander |
| 1st Author's Name | Toshinori YAMADA |
| 1st Author's Affiliation | Graduate School of Science and Engineering Tokyo Institute of Technology() |
| 2nd Author's Name | Shuichi UENO |
| 2nd Author's Affiliation | Graduate School of Science and Engineering Tokyo Institute of Technology |
| Date | 2003/1/17 |
| Paper # | COMP2002-62 |
| Volume (vol) | vol.102 |
| Number (no) | 593 |
| Page | pp.pp.- |
| #Pages | 7 |
| Date of Issue | |