1591 search results - page 217 / 319 » Random lifts of graphs |
189
click to vote
TCOM
2008
15 years 6 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...
172
click to vote
SOCIALCOM
2010
15 years 4 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...
184
click to vote
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
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...
166
click to vote
AISS
2010
15 years 3 months ago
2010
The vehicle routing problem consists in determining a group of optimal delivery routes that allow satisfaction of the demand from customers spread along a network, which can be re...
275
click to vote
SIAMCOMP
2011
14 years 9 months ago
2011
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...