Sciweavers

1949 search results - page 24 / 390
» Random graphs on surfaces
Sort
View
STOC
2003
ACM
109views Algorithms» more  STOC 2003»
16 years 2 days ago
Generating random regular graphs
Random regular graphs play a central role in combinatorics and theoretical computer science. In this paper, we analyze a simple algorithm introduced by Steger and Wormald [10] and...
Jeong Han Kim, Van H. Vu
FOCS
2007
IEEE
15 years 6 months ago
Reconstruction for Models on Random Graphs
Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given ‘far away’ observations. Sever...
Antoine Gerschenfeld, Andrea Montanari
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
15 years 6 months ago
Implementing Huge Sparse Random Graphs
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
Moni Naor, Asaf Nussboim
WABI
2005
Springer
15 years 5 months ago
Improved Maintenance of Molecular Surfaces Using Dynamic Graph Connectivity
We present recent developments in efficiently maintaining the boundary and surface area of protein molecules as they undergo conformational changes. As the method that we devised k...
Eran Eyal, Dan Halperin
CPC
2011
189views Education» more  CPC 2011»
14 years 6 months ago
A Counter-Intuitive Correlation in a Random Tournament
Consider a randomly oriented graph G = (V, E) and let a, s and b be three distinct vertices in V . We study the correlation between the events {a → s} and {s → b}. We show that...
Sven Erick Alm, Svante Linusson