AbstractThe problem of broadcasting in grid graphs is discussed. Two algorithms for broadcasting m messages in an n×n grid are given. These algorithms require time max(n+52m−1, 2n+2m−4) and time 2n+52m − 4. An algorithm for broadcasting m messages in an n×n×n grid which requires time 3n+103m + 2 is presented. It is conjectured that similar algorithms exist for d-dimensional grids which require time dn + (d2 + 1)/dm + constant
Broadcasting is an information dissemination problem in which information originating at one node of...
A broadcast graph is an n-vertex communication network that supports a broadcast from any one vertex...
AbstractGiven a graph G=(V,E) and a vertex u∈V, broadcasting is the process of disseminating a piece...
AbstractThe problem of broadcasting in grid graphs is discussed. Two algorithms for broadcasting m m...
AbstractAn algorithm for broadcasting multiple messages on a d-dimensional grid (d ⩾ 3) starting fro...
This work consists of two separate parts. The first part deals with the problem of multiple message ...
We propose broadcasting algorithms for line digraphs in the telephone model. The new protocols use a...
AbstractOne of the major problems that have arisen in communication networks is that of broadcasting...
Broadcasting is a fundamental information dissemination problem, wherein a message is sent from one ...
AbstractThe results of Fujita and Farley (Discrete Appl. Math. 75 (1997) 255–268) and Kane and Peter...
AbstractBroadcasting is an information dissemination process in which a message is to be sent from a...
AbstractGiven a finite nonempty set F of vectors in Zm, consider the graph G=(V,E) whose vertices ar...
We study abstract networks called graphs, collections of nodes and connections between certain pairs...
AbstractBroadcasting in processor networks means disseminating a single piece of information, which ...
AbstractThe broadcast function, B(n), is the minimum number of edges in any graph on n vertices such...
Broadcasting is an information dissemination problem in which information originating at one node of...
A broadcast graph is an n-vertex communication network that supports a broadcast from any one vertex...
AbstractGiven a graph G=(V,E) and a vertex u∈V, broadcasting is the process of disseminating a piece...
AbstractThe problem of broadcasting in grid graphs is discussed. Two algorithms for broadcasting m m...
AbstractAn algorithm for broadcasting multiple messages on a d-dimensional grid (d ⩾ 3) starting fro...
This work consists of two separate parts. The first part deals with the problem of multiple message ...
We propose broadcasting algorithms for line digraphs in the telephone model. The new protocols use a...
AbstractOne of the major problems that have arisen in communication networks is that of broadcasting...
Broadcasting is a fundamental information dissemination problem, wherein a message is sent from one ...
AbstractThe results of Fujita and Farley (Discrete Appl. Math. 75 (1997) 255–268) and Kane and Peter...
AbstractBroadcasting is an information dissemination process in which a message is to be sent from a...
AbstractGiven a finite nonempty set F of vectors in Zm, consider the graph G=(V,E) whose vertices ar...
We study abstract networks called graphs, collections of nodes and connections between certain pairs...
AbstractBroadcasting in processor networks means disseminating a single piece of information, which ...
AbstractThe broadcast function, B(n), is the minimum number of edges in any graph on n vertices such...
Broadcasting is an information dissemination problem in which information originating at one node of...
A broadcast graph is an n-vertex communication network that supports a broadcast from any one vertex...
AbstractGiven a graph G=(V,E) and a vertex u∈V, broadcasting is the process of disseminating a piece...
DOI
Add to ORKG