A Steiner star for a set P of n points in Rd connects an arbitrary center point to all points of P, while a star connects a point p P to the remaining n-1 points of P. All connec...
The vast majority of earlier work has focused on graphs which are both connected (typically by ignoring all but the giant connected component), and unweighted. Here we study numer...
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
Peer-to-Peer file sharing applications, which enable peers to establish multiple TCP connections between other peers to transfer data, pose new challenge to congestion control. Si...
Eigenvectors to the second smallest eigenvalue of the Laplace matrix of a graph, also known as Fiedler vectors, are the basic ingredient in spectral graph partitioning heuristics....