This paper is a survey of existing methods of communication in usual networks. We
particularly study the complete network, the ring, the torus, the grid, the hypercube, the cube …

Gossiping is an information dissemination problem in which each node of a communication
network has a unique piece of information that must be transmitted to all other nodes using …

Gossiping is the process of information diffusion in which each node of a network holds a
packet that must be communicated to all other nodes in the network. We consider the …

Given a graph G=(V, E) and a vertex u∈ V, broadcasting is the process of disseminating a
piece of information from vertex u to every other vertex in the graph where, in each time unit …

We continue the investigation of k‐broadcasting, a variant of broadcasting in which an
informed vertex can call up to k of its neighbors in each time unit. A focus of the investigation …

Broadcasting is a basic problem of communication in usual networks. Many papers have
investigated the construction of minimum broadcast networks, the cheapest possible …

Broadcasting is an information dissemination problem in a connected network, in which one
node, called the originator, disseminates a message to all other nodes by placing a series of …

A broadcast graph is a connected graph, G=(V, E),| V|= n, in which each vertex can complete
broadcasting of one message within at most t=⌈ log n⌉ time units. A minimum broadcast …

Broadcasting is an information dissemination problem in a connected graph in which one
vertex, called the originator, must distribute a message to all other vertices by placing a …

Broadcasting is the task of transmitting a message originated at one processor of a
communication network to all other processors in the network. A minimal k‐fault‐tolerant …