2079 search results - page 224 / 416 » Universality of random graphs |
186
click to vote
COMPGEOM
2003
ACM
15 years 11 months ago
2003
ACM
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
173
click to vote
AGTIVE
1999
Springer
15 years 11 months ago
1999
Springer
A suitable software architecture –for example in the area of distributed application– can be composed of known-to-work solutions. These are also known as design patterns. Howev...
204
click to vote
MPC
2010
Springer
15 years 8 months ago
2010
Springer
ion of Object Graphs in Program Verification Yifeng Chen1 and J.W. Sanders2 1 HCST Key Lab at School of EECS, Peking University, China. 2 UNU-IIST, Macao. A set-theoretic formalism...
153
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Uniform sampling from graphical realizations of a given degree sequence is a fundamental component in simulation-based measurements of network observables, with applications rangi...
177
click to vote
SIGMETRICS
2008
ACM
15 years 6 months ago
2008
ACM
During the past decade, a number of different studies have identified several peculiar properties of networks that arise from a diverse universe, ranging from social to computer n...