1542 search results - page 115 / 309 » The metamathematics of random graphs |
123
click to vote
GBRPR
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. In this paper, we propose a novel method for the unsupervised clustering of graphs in the context of the constellation approach to object recognition. Such method is an E...
123
Voted
SOCIALCOM
2010
14 years 11 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...
128
click to vote
GECCO
2009
Springer
14 years 11 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...
111
click to vote
AISS
2010
14 years 11 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...
203
Voted
SIAMCOMP
2011
14 years 4 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...