5606 search results - page 77 / 1122 » Randomization Techniques for Graphs. |
STOC
2004
ACM
14 years 9 months ago
2004
ACM
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
APPROX
2007
Springer
14 years 3 months ago
2007
Springer
We initiate a systematic study of eigenvectors of random graphs. Whereas much is known about eigenvalues of graphs and how they reflect properties of the underlying graph, relati...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
ICRA
2002
IEEE
14 years 2 months ago
2002
IEEE
As a general framework to determine a collision-free feedback motion strategies, the Random Neighborhood Graph (RNG) approach [19] defines a global navigation function over an ap...
DM
2010
13 years 9 months ago
2010
In the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as ...