214 search results - page 20 / 43 » Note on Sparse Random Graphs and Cover Graphs |
SODA
2012
ACM
11 years 11 months 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,...
TAMC
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. In property testing, the goal is to distinguish between objects that satisfy some desirable property and objects that are far from satisfying it, after examining only a s...
CN
2010
13 years 5 months ago
2010
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
RSA
2010
13 years 7 months ago
2010
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
INFOCOM
2006
IEEE
14 years 3 months ago
2006
IEEE
— We propose efficient distributed algorithms to aid navigation of a user through a geographic area covered by sensors. The sensors sense the level of danger at their locations ...