Sciweavers

1949 search results - page 63 / 390
» Random graphs on surfaces
Sort
View
ICRA
2002
IEEE
106views Robotics» more  ICRA 2002»
15 years 8 months ago
An Improved Random Neighborhood Graph Approach
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...
Libo Yang, Steven M. LaValle
DATE
2007
IEEE
92views Hardware» more  DATE 2007»
15 years 10 months ago
Random sampling of moment graph: a stochastic Krylov-reduction algorithm
In this paper we introduce a new algorithm for model order reduction in the presence of parameter or process variation. Our analysis is performed using a graph interpretation of t...
Zhenhai Zhu, Joel R. Phillips
DM
2010
140views more  DM 2010»
15 years 4 months ago
Online Ramsey games for triangles in random graphs
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 ...
József Balogh, Jane Butterfield
145
Voted
ESA
2001
Springer
132views Algorithms» more  ESA 2001»
15 years 8 months ago
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
Michele Zito
DMTCS
2006
66views Mathematics» more  DMTCS 2006»
15 years 3 months ago
On randomly colouring locally sparse graphs
We consider the problem of generating a random q-colouring of a graph G = (V, E). We consider the simple Glauber Dynamics chain. We show that if for all v V the average degree of...
Alan M. Frieze, Juan Vera