2079 search results - page 94 / 416 » Universality of random graphs |
173
click to vote
ALGORITHMICA
2006
15 years 4 months ago
2006
Dai, Li, and Wu proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. In this paper we consider the "average...
124
click to vote
FSTTCS
2008
Springer
15 years 5 months ago
2008
Springer
We consider the isomorphism and canonization problem for 3-connected planar graphs. The problem was known to be L -hard and in UL ∩ coUL [TW08]. In this paper, we give a determin...
ENDM
2006
15 years 4 months ago
2006
Jim Propp's rotor router model is a simple deterministic analogue of a random walk. Instead of distributing chips randomly, it serves the neighbors in a fixed order. We analy...
143
click to vote
ALT
2007
Springer
16 years 1 months ago
2007
Springer
It has been recently shown that calibration with an error less than ∆ > 0 is almost surely guaranteed with a randomized forecasting algorithm, where forecasts are obtained by...
131
click to vote
GBRPR
2009
Springer
15 years 11 months ago
2009
Springer
A universal data model, named DG, is introduced to handle vectorized data uniformly during the whole recognition process. The model supports low level graph algorithms as well as h...