592 search results - page 24 / 119 » Crossing numbers of random graphs |
SODA
1993
ACM
13 years 9 months ago
1993
ACM
We consider the performance of a simple greedy matching algorithm MINGREEDY when applied to random cubic graphs. We show that if λn is the expected number of vertices not matched...
JGAA
2010
13 years 6 months ago
2010
We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. For positive we have a construction which shows that all chordal graphs that ca...
TSP
2008
13 years 7 months ago
2008
A random access protocol named ALLIANCES was recently proposed, that achieves high throughput by resolving collisions in wireless networks. ALLIANCES exploits diversity provided b...
CAAN
2004
Springer
14 years 1 months ago
2004
Springer
We consider a generalized copy model of the web graph and related networks, and analyze its limiting behaviour. The model is motivated by previously proposed copying models of the ...
COMBINATORICA
2008
13 years 8 months ago
2008
A random geometric graph Gn is constructed by taking vertices X1, . . . , Xn Rd at random (i.i.d. according to some probability distribution with a bounded density function) and...