113 search results - page 2 / 23 » Rigid Components of Random Graphs |
COMBINATORICS
2000
13 years 6 months ago
2000
In this paper we consider the problem of establishing a value r0 such that almost all random graphs with n vertices and rn edges, r > r0, are asymptotically not 3-colorable. In...
JUCS
2007
13 years 6 months ago
2007
: Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of some families of generic minimally rigid structures...
WAW
2007
Springer
14 years 11 days ago
2007
Springer
The geographical threshold graph model is a random graph model with nodes distributed in a Euclidean space and edges assigned through a function of distance and node weights. We st...
CPC
1998
13 years 6 months ago
1998
Given a sequence of non-negative real numbers 0 1 ::: which sum to 1, we consider a random graph having approximately in vertices of degree i. In 12] the authors essentially show ...
ICRA
2005
IEEE
13 years 12 months ago
2005
IEEE
— This paper presents a method for a planar rigid body consisting of multiple convex bodies to explore an unknown planar workspace, i.e., an unknown configuration space diffeomo...