592 search results - page 23 / 119 » Crossing numbers of random graphs |
148
click to vote
CPC
2007
15 years 5 months ago
2007
In a previous paper we showed that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. Here we extend the method to show that a random 6-regular...
152
click to vote
GD
2003
Springer
15 years 10 months ago
2003
Springer
In this paper we consider the problem of drawing a planar graph using circular arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of points in t...
156
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
166
Voted
RSA
2000
15 years 5 months ago
2000
The creation and growth of components of a given complexity in a random graph process are studied. In particular, the expected number and total size of all such components is found...
164
Voted
FOCS
2003
IEEE
15 years 10 months ago
2003
IEEE
We show that random graphs in the preferential connectivity model have constant conductance, and hence have worst-case routing congestion that scales logarithmically with the numb...