Krishnamoorthy, Thulasiraman and Swamy [Minimum order graphs with specified diameter, connectivity and regularity, Networks 19 (1989) 25–46] showed that a δ-regular graph with...
In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The pro...
This paper presents a lower bound of (D + n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of ...
of Polyhedra: Limits of Abstraction Friedrich Eisenbrand∗ Nicolai Hähnle† Alexander Razborov‡ Thomas Rothvoߧ September 25, 2009 tigate the diameter of a natural abstract...
We address the problem of reconstructing a planar shape from a finite number of noisy measurements of its support function or its diameter function. New linear and non-linear algor...
Amyn Poonawala, Peyman Milanfar, Richard J. Gardne...