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 ...

The Hirsch conjecture states that the combinatorial diameter of every convex d-polytope with n facets is bounded by n-d. Hirsch Conjecture (1957): Let P be a convex d-polytope with n facets. Then the ...