An O(n)-vertex graph G (n; p) is called a random-fault-tolerant (RFT) graph for an n-vertex graph Gn if G (n; p) contains Gn as a subgraph with probability Prob(Gn,
Given a graph G on n vertices with average degree d, form a random subgraph Gp by choosing each edge...
We consider the issue of protection in very large networks displaying randomness in topology. We emp...
The aim of this paper is to study communication in networks where nodes fail in a random dependent w...
AbstractA network G∗ is called random-fault-tolerant (RFT) network for a network G if G∗ contains a ...
The original publication is available at http://www.springerlink.com/book-series/?sortorder=asc © S...
In this paper we analyze the computational power of random geometric networks in the presence of r...
AbstractLet G be a given graph (modelling a communication network) which we assume suffers from stat...
AbstractWe consider the problem of broadcasting in an n-vertex graph a message that originates from ...
AbstractLet G be a given graph (modelling a communication network) which we assume suffers from stat...
AbstractRandom regular graphs are, at least theoretically, popular communication networks. The reaso...
We consider the reliability of graphs for which nodes fail independently of each other with a consta...
It is well known that star graphs are strongly resilient like the n cubes in the sense that they are...
AbstractSuppose ach node (and each edge) of a network is independently faulty with probability at mo...
AbstractA vertex subset F is an Rg-cut of a connected graph G if G−F is disconnected and every verte...
AbstractGiven a connected graph G and a failure probability p(e) for each edge e in G, the reliabili...
Given a graph G on n vertices with average degree d, form a random subgraph Gp by choosing each edge...
We consider the issue of protection in very large networks displaying randomness in topology. We emp...
The aim of this paper is to study communication in networks where nodes fail in a random dependent w...
AbstractA network G∗ is called random-fault-tolerant (RFT) network for a network G if G∗ contains a ...
The original publication is available at http://www.springerlink.com/book-series/?sortorder=asc © S...
In this paper we analyze the computational power of random geometric networks in the presence of r...
AbstractLet G be a given graph (modelling a communication network) which we assume suffers from stat...
AbstractWe consider the problem of broadcasting in an n-vertex graph a message that originates from ...
AbstractLet G be a given graph (modelling a communication network) which we assume suffers from stat...
AbstractRandom regular graphs are, at least theoretically, popular communication networks. The reaso...
We consider the reliability of graphs for which nodes fail independently of each other with a consta...
It is well known that star graphs are strongly resilient like the n cubes in the sense that they are...
AbstractSuppose ach node (and each edge) of a network is independently faulty with probability at mo...
AbstractA vertex subset F is an Rg-cut of a connected graph G if G−F is disconnected and every verte...
AbstractGiven a connected graph G and a failure probability p(e) for each edge e in G, the reliabili...
Given a graph G on n vertices with average degree d, form a random subgraph Gp by choosing each edge...
We consider the issue of protection in very large networks displaying randomness in topology. We emp...
The aim of this paper is to study communication in networks where nodes fail in a random dependent w...
Add to ORKG