— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...
Asad Awan, Ronaldo A. Ferreira, Suresh Jagannathan...
We consider the problem of sampling URLs uniformly at random from the Web. A tool for sampling URLs uniformly can be used to estimate various properties of Web pages, such as the ...
Monika Rauch Henzinger, Allan Heydon, Michael Mitz...
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
This paper describes a graph-spectral method for 3D surface integration. The algorithm takes as its input a 2D field of surface normal estimates, delivered, for instance, by a sh...
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...