scientific article; zbMATH DE number 857072

Ralf Klasing, Juraj Hromkovič, Burkhard Monien, Regine Peine

Publication date: 9 April 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Applications of graph theory (05C90) Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory to circuits and networks (94C15)

Related Items

Hierarchical broadcast networks ⋮ Gossiping and broadcasting versus computing functions in networks ⋮ Broadcast time and connectivity ⋮ Unnamed Item ⋮ Broadcasting multiple messages in the 1-in port model in optimal time ⋮ Optimal algorithms for broadcast and gossip in the edge-disjoint path modes ⋮ Effective systolic algorithms for gossiping in cycles and two-dimensional grids ⋮ On the number of broadcast schemes in networks ⋮ On the communication complexity of polling ⋮ Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes ⋮ Optimal gossiping in square 2D meshes ⋮ The complexity of finding a broadcast center ⋮ Robust gossiping with an application to consensus ⋮ Periodic gossiping in back-to-back trees ⋮ Reliable broadcasting in double loop networks ⋮ Unnamed Item ⋮ Colouring paths in directed symmetric trees with applications to WDM routing ⋮ Optimal odd gossiping ⋮ On the radius of nonsplit graphs and information dissemination in dynamic networks ⋮ Minimum time broadcast in faulty star networks ⋮ Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks ⋮ All-to-all broadcast problem of some classes of graphs under the half duplex all-port model ⋮ Broadcasting in split graphs ⋮ Approximation algorithms in graphs with known broadcast time of the base graph ⋮ Broadcast graphs using new dimensional broadcast schemes for Knödel graphs ⋮ On the complexity of the shortest-path broadcast problem ⋮ Search on a Line by Byzantine Robots ⋮ Deterministic broadcasting time with partial knowledge of the network. ⋮ Aggregation tree construction using hierarchical structures ⋮ Gossiping in vertex-disjoint paths mode in interconnection networks ⋮ Diameter of General Knödel Graphs ⋮ Messy broadcasting - decentralized broadcast schemes with limited knowledge ⋮ Spreading Messages ⋮ A distributed algorithm for directed minimum-weight spanning tree ⋮ Spreading of messages in random graphs ⋮ The logic of gossiping ⋮ Upper bounds on the broadcast function using minimum dominating sets ⋮ Gossiping and broadcasting versus computing functions in networks. ⋮ Dynamic faults have small effect on broadcasting in hypercubes. ⋮ A survey on Knödel graphs. ⋮ Diametral broadcast graphs ⋮ On linear-time data dissemination in dynamic rooted trees ⋮ The worst case behavior of randomized gossip protocols ⋮ A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem ⋮ Parsimonious flooding in dynamic graphs ⋮ The complexity of systolic dissemination of information in interconnection networks ⋮ Rooted level-disjoint partitions of Cartesian products ⋮ Fast gossiping by short messages ⋮ Odd gossiping ⋮ Minimum multiple originator broadcast graphs ⋮ Concurrent multicast in weighted networks ⋮ Broadcasting from multiple originators ⋮ Lower bounds on systolic gossip ⋮ A note on line broadcast in digraphs under the edge-disjoint paths mode ⋮ Search on a line with faulty robots ⋮ Faster gossiping on butterfly networks ⋮ Concurrent multicast in weighted networks ⋮ Communication in the two-way listen-in vertex-disjoint paths mode ⋮ Deterministic Models of Communication Faults ⋮ Communication complexity of gossiping by packets ⋮ Gathering in the plane of location-aware robots in the presence of spies ⋮ Broadcasting in weighted trees under the postal model ⋮ Sparse hypercube -- a minimal \(k\)-line broadcast graph. ⋮ Optimal sequential gossiping by short messages ⋮ Communication complexity of fault-tolerant information diffusion ⋮ A note on the lower bound of centralized radio broadcasting for planar reachability graphs ⋮ On broadcasting in unicyclic graphs ⋮ Graphs and Algorithms in Communication Networks on Seven League Boots ⋮ Optimal gossiping in paths and cycles ⋮ Optimal broadcast on parallel locality models ⋮ Efficient collective communciation in optical networks ⋮ Group search of the plane with faulty robots ⋮ Symmetric flows and broadcasting in hypercubes ⋮ Compound constructions of broadcast networks ⋮ Broadcasting in hypercubes and star graphs with dynamic faults. ⋮ Verifiable broadcasting and gossiping in communication networks ⋮ Hierarchical broadcast and gossip networks