721 search results - page 77 / 145 » Almost universal graphs |
CN
2010
13 years 6 months ago
2010
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
COMPGEOM
2003
ACM
14 years 3 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...
AGTIVE
1999
Springer
14 years 2 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...
MPC
2010
Springer
13 years 12 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...
CORR
2010
Springer
13 years 10 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...