How robust is the n-cube?

DOI10.1016/0890-5401(88)90056-9zbMATH Open0647.68007OpenAlexW2005280076MaRDI QIDQ1104728FDOQ1104728

Hans Ulrich Simon, Bernd Becker

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

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

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)

Cites Work

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

Cited In (19)

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

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)