Broadcasting in Bounded Degree Graphs
From MaRDI portal
Publication:3989008
DOI10.1137/0405002zbMath0753.68007OpenAlexW1998241571MaRDI QIDQ3989008
Arthur L. Liestman, Joseph G. Peters, Jean-Claude Bermond, 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
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99) Communication theory (94A05)
Related Items (18)
Bounded-call broadcasting ⋮ Methods and problems of communication in usual networks ⋮ Broadcasting in butterfly and deBruijn networks ⋮ Bounded depth broadcasting ⋮ 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 ⋮ Data transmission in processor networks ⋮ More broadcast graphs ⋮ The minimum broadcast time problem for several processor networks ⋮ Sparse broadcast graphs ⋮ Broadcasting and spanning trees in de Bruijn and Kautz networks ⋮ Broadcasting in DMA-bound bounded degree graphs ⋮ The complexity of broadcasting in planar and decomposable graphs ⋮ Lower bounds on systolic gossip ⋮ Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs ⋮ Compound constructions of broadcast networks ⋮ Graph theoretical issues in computer networks
This page was built for publication: Broadcasting in Bounded Degree Graphs
