Linearly Many Edge-Faults in 2-Bijective Connection Networks

DOI10.1142/S0129626415500061MaRDI QIDQ4598907zbMATHOpenAlexWikidataFDO

Authors Dhruv Medarametla, Eddie Cheng, Steven Cheng, Lawrance Wu

Publication date 15 December 2017

Published in Parallel Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129626415500061

zbMATH Keywords

connectivityfault diagnosis2-bijective connection networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• Linearly many faults in 2-tree-generated networks
• Linearly many faults in dual-cube-like networks
• Linearly many faults in arrangement graphs
• Edge fault-tolerance of strongly Menger edge connected graphs
• Tolerating linear number of faults in networks of bounded degree
• Linearly many faults in \((n,k)\)-star graphs
• Fault-Tolerant Strong Menger (Edge) Connectivity of DCC Linear Congruential Graphs
• Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity
• Edge fault tolerance of graphs with respect to \(\lambda_{2}\)-optimal property
• Edge-colored graphs with applications to homogeneous faults

Cited in

(5)

• Efficient unicast in bijective connection networks with the restricted faulty node set
• An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
• scientific article; zbMATH DE number 2174612 (Why is no real title available?)
• Structural properties of 2-bijective connection networks and 2-matching composition networks
• Some properties of BC graphs

This page was built for publication: Linearly Many Edge-Faults in 2-Bijective Connection Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598907)