69 search results - page 7 / 14 » The cover time of sparse random graphs |
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
SODA
2012
ACM
13 years 9 days ago
2012
ACM
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...
103
click to vote
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
MST
2010
14 years 8 months ago
2010
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
SPAA
2005
ACM
15 years 3 months ago
2005
ACM
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...