Broadcasting in Bounded Degree Graphs

DOI10.1137/0405002MaRDI QIDQ3989008zbMATH OpenOpenAlexFDO

Authors Jean-Claude Bermond, Arthur L. Liestman, Joseph G. Peters, Pavol Hell

Publication date 28 June 1992

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/hal-03189954/file/81-BHLP92b-Broadcasting%20bounded%20degree.pdf

zbMATH Keywords

networksbroadcastingbounded degree graphsde Bruijn digraphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Communication theory (94A05) Graph theory (05C99) Network design and communication in computer systems (68M10)

Recommendations

• Broadcast Networks of Bounded Degree
• Broadcasting in DMA-bound bounded degree graphs
• scientific article; zbMATH DE number 219254
• Broadcasts in graphs
• Broadcasting in random graphs
• Broadcasting in random graphs
• scientific article; zbMATH DE number 1191227
• scientific article; zbMATH DE number 1792638

Cited in

(38)

• Minimum average broadcast time in a graph of bounded degree.
• Minimum linear gossip graphs and maximal linear \((\Delta,k)\)-gossip graphs
• Broadcasts in graphs
• Extremal broadcasting problems
• Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks
• The minimum broadcast time problem for several processor networks
• On the optimality of general lower bounds for broadcasting and gossiping
• Broadcasting in generalized chordal rings
• Lower bounds on systolic gossip
• Finding broadcast 2-centers of a tree under the postal model
• Sparse broadcast graphs
• Broadcasting in DMA-bound bounded degree graphs
• scientific article; zbMATH DE number 4102999 (Why is no real title available?)
• Compound constructions of broadcast networks
• Broadcasting in butterfly and deBruijn networks
• Bounded-call broadcasting
• scientific article; zbMATH DE number 1792638 (Why is no real title available?)
• Data transmission in processor networks
• On the monotonicity of the broadcast function
• Broadcasting on recursively decomposable Cayley graphs
• More broadcast graphs
• scientific article; zbMATH DE number 3869385 (Why is no real title available?)
• Broadcasting in butterfly and deBruijn networks (extended abstract)
• scientific article; zbMATH DE number 2089975 (Why is no real title available?)
• The multiple originator broadcasting problem in graphs
• Graph theoretical issues in computer networks
• Methods and problems of communication in usual networks
• Degree- and time-constrained broadcast networks
• Broadcasting on Random Directed Acyclic Graphs
• scientific article; zbMATH DE number 219254 (Why is no real title available?)
• \(k\)-broadcasting in trees
• The complexity of broadcasting in planar and decomposable graphs
• The complexity of broadcasting in planar and decomposable graphs
• Broadcasting in random graphs
• Sparse hypercube -- a minimal \(k\)-line broadcast graph.
• Broadcasting and spanning trees in de Bruijn and Kautz networks
• scientific article; zbMATH DE number 1191227 (Why is no real title available?)
• Bounded depth broadcasting

This page was built for publication: Broadcasting in Bounded Degree Graphs

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