The wide diameter of a graph is a natural generalization of diameter in a graph when we take account of the connectivity of the graph. In this paper, we define the generalized wide diameter of a graph ...
In this paper we study the impact of random exponential edge weights on the distances in a random graph and, in particular, on its diameter. Our main result consists of a precise asymptotic expression ...
A team of researchers at ETH Zurich are working on a novel approach to solving increasingly large graph problems. Large graphs are a basis of many problems in social sciences (e.g., studying human ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results