Optimal broadcasting in faulty trees

DOI10.1006/JPDC.2000.1625MaRDI QIDQ1577006zbMATH OpenOpenAlexFDO

Authors Petrişor Panaite, Andrzej Pelc

Publication date 27 August 2000

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.2000.1625

zbMATH Keywords

broadcasting

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Time bounds on fault‐tolerant broadcasting
• Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults
• On optimal broadcasting in faulty hypercubes
• Fault-tolerant broadcasting in radio networks

Cited in

(2)

• scientific article; zbMATH DE number 913359 (Why is no real title available?)
• Time bounds on fault‐tolerant broadcasting

This page was built for publication: Optimal broadcasting in faulty trees

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