✦ LIBER ✦

Fault tolerance in the arrangement graphs

✍ Scribed by Wang, Shiying; Feng, Kai

Book ID: 125444194
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 393 KB
Volume: 533
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.03.025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Conditional fault tolerance of arrangeme

Conditional fault tolerance of arrangement graphs

✍ Shuming Zhou; Jun-Ming Xu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 188 KB

Edge fault tolerance in graphs

✍ Frank Harary; John P. Hayes 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 628 KB

Node fault tolerance in graphs

✍ Harary, Frank; Hayes, John P. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 405 KB 👁 2 views

A graph G \* is a k-node fault-tolerant supergraph of a graph G , denoted k-NFT( G), if every graph obtained by removing k nodes from G\* contains G. A k-NFT(G) graph G\* is said to be optimal if it contains n + k nodes, where n is the number of nodes of G and G \* has the minimum number of edges am

Linearly many faults in arrangement grap

Linearly many faults in arrangement graphs

✍ Eddie Cheng; László Lipták; Allen Yuan 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 152 KB

Fault-tolerant broadcast graphs

✍ Arthur L. Liestman 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 555 KB

Fault Tolerance of Cayley Graphs

✍ Shuhong Gao; Beth Novick 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 145 KB