Two broadcasting problems in faulty hypercubes

DOI10.1007/3-540-46784-X_18MaRDI QIDQ4944977zbMATH OpenFDO

Authors Stefan Dobrev, Imrich Vrt'o

Publication date 17 October 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46784-X_18

zbMATH Keywords

broadcasting problems

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Optimal broadcasting in hypercubes with dynamic faults
• Broadcasting in hypercubes with randomly distributed Byzantine faults
• A note on optimal time broadcast in faulty hypercubes
• scientific article; zbMATH DE number 1138357
• Broadcasting in hypercubes and star graphs with dynamic faults.
• Fault—tolerant hypercube broadcasting via information dispersal
• Broadcasting in a hypercube when some calls fail
• Dynamic faults have small effect on broadcasting in hypercubes.
• Reliable broadcasting in hypercubes with random link and node failures

Cited in

(8)

• Broadcasting in a hypercube when some calls fail
• On optimal broadcasting in faulty hypercubes
• Dynamic faults have small effect on broadcasting in hypercubes.
• Optimal broadcasting in hypercubes with dynamic faults
• A note on optimal time broadcast in faulty hypercubes
• Reliable broadcasting in hypercubes with random link and node failures
• Neighborhood Broadcasting in Hypercubes
• scientific article; zbMATH DE number 1933233 (Why is no real title available?)

This page was built for publication: Two broadcasting problems in faulty hypercubes

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