Minimum-time line broadcast networks
From MaRDI portal
Publication:3870643
DOI10.1002/net.3230100106zbMath0432.90030OpenAlexW2157066436MaRDI QIDQ3870643
Publication date: 1980
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230100106
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items
Optimal algorithms for dissemination of information in generalized communication modes, Low‐cost minimum‐time line‐broadcasting schemes in complete binary trees, Optimal algorithms for broadcast and gossip in the edge-disjoint path modes, Optimal algorithms for broadcast and gossip in the edge-disjoint modes, Minimum-cost line broadcast in paths, Unnamed Item, Broadcast and gossip in line-communication mode, The relationship between gossiping in vertex-disjoint paths mode and bisection width, Line broadcasting in cycles, The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width, Toward a general theory of unicast-based multicast communication, Gossiping in vertex-disjoint paths mode in interconnection networks, A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem, Multiple Routing Strategies in a Labelled Network, A note on line broadcast in digraphs under the edge-disjoint paths mode, Gossiping in chordal rings under the line model, Communication in the two-way listen-in vertex-disjoint paths mode, Efficient line broadcasting in a \(d\)-dimensional grid, Sparse hypercube -- a minimal \(k\)-line broadcast graph., Efficient collective communciation in optical networks, Length-constrained path-matchings in graphs
