✦ LIBER ✦

Fault tolerance in bubble-sort graph networks

✍ Scribed by Shiying Wang; Yuxing Yang

Book ID: 113927597
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 281 KB
Volume: 421
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.11.016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge-fault-tolerant edge-bipancyclicity

Edge-fault-tolerant edge-bipancyclicity of bubble-sort graphs

✍ Xin Ping Xu; Min Xu; Jin Jing 📂 Article 📅 2011 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 368 KB

Fault-tolerance in balanced sorting netw

Fault-tolerance in balanced sorting networks

✍ Jianli Sun; Jan Gecsei; Eduard Cerny 📂 Article 📅 1990 🏛 Springer US 🌐 English ⚖ 662 KB

Much research has been done on sorting networks but there are very few results concerning their robustness. Our starting point is the balanced sorting network introduced by Dowd et al. and its single-block robust design of Rudolph obtained at the cost of some redundancy and two permuters external to

On Fault-Tolerant Networks for Sorting

✍ Yao, Andrew C.; Yao, F. Frances 📂 Article 📅 1985 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 998 KB

Fault tolerance of the star graph interc

Fault tolerance of the star graph interconnection network

✍ Zoran Jovanović; Jelena Mišić 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 462 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