2310 search results - page 196 / 462 » Coloring Random Graphs |
131
Voted
RSA
2008
15 years 1 months ago
2008
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
132
click to vote
EGH
2010
Springer
15 years 9 days ago
2010
Springer
Random numbers are extensively used on the GPU. As more computation is ported to the GPU, it can no longer be treated as rendering hardware alone. Random number generators (RNG) a...
187
Voted
WG
2010
Springer
15 years 20 days ago
2010
Springer
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...
147
click to vote
ICST
2010
IEEE
15 years 7 days ago
2010
IEEE
Mobile computing systems provide new challenges for verification. One of them is the dynamicity of the system structure, with mobility-induced connections and disconnections, dynam...
113
click to vote
IM
2008
15 years 2 months ago
2008
We analyze the structure of random graphs generated by the geographical threshold model. The model is a generalization of random geometric graphs. Nodes are distributed in space, a...