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

bounded degree graphsbroadcastingde Bruijn digraphsnetworks

Mathematics Subject Classification ID

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

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

(39)

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

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)