Minimum average broadcast time in a graph of bounded degree.

MaRDI QIDQ2716013zbMATH OpenFDO

Authors William Pensaert

Publication date 20 July 2005

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

average broadcast timemaximum degree

Mathematics Subject Classification ID

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

Review text

The paper studies the average broadcast time in bounded degree graphs. A lower bound of this time is presented under the assumption that the number of vertices informed each time unit is maximized.

Recommendations

• scientific article; zbMATH DE number 219254
• On the optimality of general lower bounds for broadcasting and gossiping
• Broadcasting in Bounded Degree Graphs
• scientific article; zbMATH DE number 1191227
• Bounded depth broadcasting

Cited in

(2)

• scientific article; zbMATH DE number 219250 (Why is no real title available?)
• scientific article; zbMATH DE number 219254 (Why is no real title available?)

This page was built for publication: Minimum average broadcast time in a graph of bounded degree.

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