How robust is the n-cube?

DOI10.1016/0890-5401(88)90056-9MaRDI QIDQ1104728zbMATHOpenAlexFDO

Authors Bernd Becker, Hans Ulrich Simon

Publication date 1988

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0890-5401(88)90056-9

zbMATH Keywords

chromatic numberfaulty processorfaulty linkn-cube networkdirected chromatic index

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Theory of software (68N99)

Recommendations

• Subcube fault-tolerance in hypercubes
• Subcube fault tolerance in hypercube multiprocessors
• On optimal broadcasting in faulty hypercubes
• scientific article; zbMATH DE number 637334
• Fault-tolerant cycle embedding in the faulty hypercubes

Cites work

• A decomposition theorem for partially ordered sets
• A generalization of results of P. Erdős, G. Katona, and D. J. Kleitman concerning Sperner's theorem
• Diameter bounds for altered graphs
• Every planar map is four colorable. II: Reducibility
• Families of \(k\)-independent sets
• Solutions to Edmonds' and Katona's problems on families of separating subsets
• The Indirect Binary n-Cube Microprocessor Array

Cited in

(18)

• Measuring teachability using variants of the teaching dimension
• scientific article; zbMATH DE number 1769329 (Why is no real title available?)
• scientific article; zbMATH DE number 17938 (Why is no real title available?)
• On \(n\)-column 0,1-matrices with all \(k\)-projections surjective
• The preclusion numbers and edge preclusion numbers in a class of Cayley graphs
• Robustness of star graph network under link failure
• Distributed computing on oriented anonymous hypercubes with faulty components
• SOME RESULTS ON BUDS, STEMS AND FAULT TOLERANCE IN HYPERCUBES OF DIMENSION ⋚ 5
• Application of coding theory to interconnection networks
• Subnetwork preclusion for bubble-sort networks
• Hypercube sandwich approach to conferencing.
• On the extremal combinatorics of the Hamming space
• Fault tolerance in \(k\)-ary \(n\)-cube networks
• Subcube fault-tolerance in hypercubes
• On the acyclic point-connectivity of the n-cube
• Fault tolerance in bubble-sort graph networks
• Bounds for Cube Coloring
• Improving bounds on link failure tolerance of the star graph

This page was built for publication: How robust is the n-cube?

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