✦ LIBER ✦

Fault-tolerant compact routing schemes for general graphs

✍ Scribed by Shiri Chechik

Book ID: 119257792
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 221 KB
Volume: 222
Category: Article
ISSN: 0890-5401
DOI: 10.1016/j.ic.2012.10.009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Construction schemes for fault-tolerant

Construction schemes for fault-tolerant Hamiltonian graphs

✍ Wang, Jeng-Jung; Hung, Chun-Nan; Tan, Jimmy J. M.; Hsu, Lih-Hsing; Sung, Ting-Yi 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 319 KB 👁 2 views

In this paper, we present three construction schemes for fault-tolerant Hamiltonian graphs. We show that applying these construction schemes on fault-tolerant Hamiltonian graphs generates graphs preserving the original Hamiltonicity property. We apply these construction schemes to generate some know

Fault Tolerant Spanners for General Grap

Fault Tolerant Spanners for General Graphs

✍ Chechik, S.; Langberg, M.; Peleg, D.; Roditty, L. 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 306 KB

Fault-tolerant routing in burnt pancake

Fault-tolerant routing in burnt pancake graphs

✍ Tatsuya Iwasaki; Keiichi Kaneko 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 207 KB

Cluster fault-tolerant routing in star g

Cluster fault-tolerant routing in star graphs

✍ Gu, Qian-Ping; Peng, Shietung 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 2 views

Fault-tolerant routing is a key issue in computer/ communication networks. We say a network (graph) can tolerate l faulty nodes for a routing problem if after removing at most l arbitrary faulty nodes from the graph the routing paths exist for the routing problem. However, the bound l is usually a w

Highly Fault-Tolerant Routings and Fault

Highly Fault-Tolerant Routings and Fault-Induced Diameter for Generalized Hypercube Graphs

✍ Koichi Wada; Takaharu Ikeo; Kimio Kawaguchi; Wei Chen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 130 KB

Consider a communication network G in which a limited number of link and/or node faults F might occur. A routing ρ for the network (a fixed path between each pair of nodes) must be chosen without knowing which components might become faulty. The diameter of the surviving route graph R(G, ρ)/F, where

Optimal fault-tolerant routings for conn

Optimal fault-tolerant routings for connected graphs

✍ Koichi Wada; Yupin Luo; Kimio Kawaguchi 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 455 KB