2079 search results - page 275 / 416 » Universality of random graphs |
119
click to vote
ACTAC
2007
15 years 4 months ago
2007
An o-line scheduling algorithm considers resource, precedence, and synchronisation requirements of a task graph, and generates a schedule guaranteeing its timing requirements. Th...
CACM
2008
15 years 4 months ago
2008
In this article, we study the problem of distributed selection from a theoretical point of view. Given a general connected graph of diameter D consisting of n nodes in which each ...
147
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
One property of networks that has received comparatively little attention is hierarchy, i.e., the property of having vertices that cluster together in groups, which then join to f...
157
Voted
TCOM
2008
15 years 4 months ago
2008
Network coding is a powerful coding technique that has been proved to be very effective in achieving the maximum multicast capacity. It is especially suited for new emerging networ...
144
click to vote
SOCIALCOM
2010
15 years 2 months ago
2010
The huge size of online social networks (OSNs) makes it prohibitively expensive to precisely measure any properties which require the knowledge of the entire graph. To estimate the...