Sciweavers

2310 search results - page 344 / 462
» Coloring Random Graphs
Sort
View
CACM
2008
53views more  CACM 2008»
13 years 8 months ago
Distributed selection: a missing piece of data aggregation
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 ...
Fabian Kuhn, Thomas Locher, Roger Wattenhofer
CORR
2006
Springer
102views Education» more  CORR 2006»
13 years 8 months ago
Structural Inference of Hierarchies in Networks
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...
Aaron Clauset, Cristopher Moore, M. E. J. Newman
TCOM
2008
120views more  TCOM 2008»
13 years 7 months ago
Network Coding for Efficient Multicast Routing in Wireless Ad-hoc Networks
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...
Jingyao Zhang, Pingyi Fan, Khaled Ben Letaief
SOCIALCOM
2010
13 years 5 months ago
Estimating the Size of Online Social Networks
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...
Shaozhi Ye, Shyhtsun Felix Wu
GECCO
2009
Springer
103views Optimization» more  GECCO 2009»
13 years 5 months ago
Bumblebees: a multiagent combinatorial optimization algorithm inspired by social insect behaviour
This paper introduces a multiagent optimization algorithm inspired by the collective behavior of social insects. In our method, each agent encodes a possible solution of the probl...
Francesc Comellas, Jesus Martinez-Navarro