AbstractWe consider the problem of broadcasting in an n-vertex graph a message that originates from a given vertex, in the presence of random edge faults. If the number of edge faults is at most proportional to the total number of edges, there are networks for which the broadcast can be done in time O(log n), with high probability
We consider broadcasting in radio networks that are subject to permanent node failures of unknown lo...
We consider broadcasting in radio networks that are subject to permanent node failures of unknown lo...
Abstract. This paper studies the problem of broadcasting in synchronous point-to-point networks, whe...
AbstractWe consider the problem of broadcasting in an n-vertex graph a message that originates from ...
AbstractOne of the major problems that have arisen in communication networks is that of broadcasting...
AbstractOne vertex of a graph has a message which it wishes to disseminate to all the other vertices...
AbstractIn this paper we give new results on the fault-tolerance capabilities of the star graph. We ...
We investigate the problem of broadcasting in a complete synchronous network with dynamic edge fault...
AbstractThis paper studies the problem of broadcasting in synchronous point-to-point networks, where...
Broadcasting algorithms have a various range of applications in different fields of computer science...
AbstractIn this paper, we study the following randomized broadcasting protocol. At some time t an in...
AbstractWe investigate the reliability of broadcasting in product networks containing faulty nodes a...
We consider broadcasting from a fault-free source to all nodes of a completely connected n-node net...
AbstractWe consider broadcasting with a linearly bounded number of transmission failures. For a cons...
AbstractFault-tolerant broadcasting in the message passing and radio models is considered under a pr...
We consider broadcasting in radio networks that are subject to permanent node failures of unknown lo...
We consider broadcasting in radio networks that are subject to permanent node failures of unknown lo...
Abstract. This paper studies the problem of broadcasting in synchronous point-to-point networks, whe...
AbstractWe consider the problem of broadcasting in an n-vertex graph a message that originates from ...
AbstractOne of the major problems that have arisen in communication networks is that of broadcasting...
AbstractOne vertex of a graph has a message which it wishes to disseminate to all the other vertices...
AbstractIn this paper we give new results on the fault-tolerance capabilities of the star graph. We ...
We investigate the problem of broadcasting in a complete synchronous network with dynamic edge fault...
AbstractThis paper studies the problem of broadcasting in synchronous point-to-point networks, where...
Broadcasting algorithms have a various range of applications in different fields of computer science...
AbstractIn this paper, we study the following randomized broadcasting protocol. At some time t an in...
AbstractWe investigate the reliability of broadcasting in product networks containing faulty nodes a...
We consider broadcasting from a fault-free source to all nodes of a completely connected n-node net...
AbstractWe consider broadcasting with a linearly bounded number of transmission failures. For a cons...
AbstractFault-tolerant broadcasting in the message passing and radio models is considered under a pr...
We consider broadcasting in radio networks that are subject to permanent node failures of unknown lo...
We consider broadcasting in radio networks that are subject to permanent node failures of unknown lo...
Abstract. This paper studies the problem of broadcasting in synchronous point-to-point networks, whe...
DOI
Add to ORKG