592 search results - page 33 / 119 » Crossing numbers of random graphs |
132
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yu...
139
click to vote
STACS
2004
Springer
15 years 10 months ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
146
Voted
INFOCOM
2006
IEEE
15 years 11 months ago
2006
IEEE
— Unstructured p2p and overlay network applications often require that a random graph be constructed, and that some form of random node selection take place over that graph. A ke...
180
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
158
click to vote
JGT
2006
15 years 5 months ago
2006
We begin the study of distinguishing geometric graphs. Let G be a geometric graph. An automorphism of the underlying graph that preserves both crossings and noncrossings is called...