2310 search results - page 249 / 462 » Coloring Random Graphs |
163
click to vote
TAMC
2009
Springer
16 years 23 days ago
2009
Springer
We study a new model of computation called stream checking on graph problems where a space-limited verifier has to verify a proof sequentially (i.e., it reads the proof as a strea...
158
click to vote
COLT
2005
Springer
15 years 11 months ago
2005
Springer
In recent years manifold methods have attracted a considerable amount of attention in machine learning. However most algorithms in that class may be termed “manifold-motivated...
165
click to vote
ESA
2004
Springer
15 years 11 months ago
2004
Springer
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
159
click to vote
SIROCCO
2010
15 years 7 months ago
2010
Abstract. We study strategies that minimize the instability of a faulttolerant consensus system. More precisely, we find the strategy than minimizes the number of output changes ov...
162
click to vote
COMBINATORICA
2007
15 years 6 months ago
2007
We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1 − )n vertices, in terms of the expansion prop...