Fault-Tolerant Meshes with Constant Degree(<Special Section>Selected Papers from the 17th Workshop on Circuits and Systems in Karuizawa)

スポンサーリンク

概要

• 論文の詳細を見る

• This paper proves that for every positive integers n, k and any positive number ε, we can explicitly construct a DAG G with n+O(k^<l+ε>) 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 ε, we can explicitly construct a graph H with n+O(k^<2+ε>) 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.

• 社団法人電子情報通信学会の論文
• 2005-04-01

著者

• YAMADA Toshinori

  Department of Physical Electronics, Tokyo Institute of Technology

• Yamada Toshinori

  Division Of Mathematics Electronics And Informatics Graduate School Of Science And Engineering Saita

• Yamada Toshinori

  Department Of Information And Computer Sciences Saitama University

• Yamada Toshinori

  Department Of Applied Chemistry Institute Of Colloid And Interface Science Science University Of Tok

関連論文

• On Dynamic Fault Tolerance for WSI Networks
• Fault-Tolerant Graphs for Hypercubes and Tori (Special Issue on Architectures, Algorithms and Networks for Massively parallel Computing)
• On-Line Multicasting in All-Optical Networks
• Fault-Tolerant Meshes with Constant Degree(Selected Papers from the 17th Workshop on Circuits and Systems in Karuizawa)
• A Note on the Circuit-switched Fixed Routing in Networks (特集 並列処理)
• Adsolubilization of Yellow OB and Parsol in Dioctadecyldimethylammonium Chloride Layer on Silica
• Fault-Tolerant Meshes with Efficient Layouts
• The O-Sequence : Representation of 3D-Dissection
• On the Number of Rooms in a Rectangular Solid Dissection

スポンサーリンク