scientific article; zbMATH DE number 857072

zbMATH Open0840.68088MaRDI QIDQ4870160FDOQ4870160

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

Publication date: 9 April 1996

Title of this publication is not available (Why is that?)

Recommendations

• Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
• A survey of gossiping and broadcasting in communication networks
• scientific article; zbMATH DE number 3693173
• Broadcasting and Gossiping in de Bruijn Networks
• Gossiping and broadcasting versus computing functions in networks
• Information dissemination in dynamic hypernetwork
• Gossiping and broadcasting versus computing functions in networks.
• Dynamics of gossip-like information dissemination in complex computer networks
• Publication:3359735
• Optimal algorithms for dissemination of information in some interconnection networks

Mathematics Subject Classification ID

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

Cited In (87)

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

This page was built for publication:

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