2310 search results - page 110 / 462 » Coloring Random Graphs |
106
click to vote
CORR
2010
Springer
15 years 2 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...
107
click to vote
STACS
2004
Springer
15 years 7 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 ...
138
click to vote
IM
2008
15 years 2 months ago
2008
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
136
click to vote
ALENEX
2003
15 years 3 months ago
2003
Graph models for real-world complex networks such as the Internet, the WWW and biological networks are necessary for analytic and simulation-based studies of network protocols, al...
ICDT
2007
ACM
15 years 8 months ago
2007
ACM
We consider random graphs, and their extensions to random structures, with edge probabilities of the form βn−α , where n is the number of vertices, α, β are fixed and α >...