617 search results - page 88 / 124 » On the Chromatic Number of Random Graphs |
160
click to vote
AAAI
2010
15 years 5 months ago
2010
We present novel randomized algorithms for solving global motion planning problems that exploit the computational capabilities of many-core GPUs. Our approach uses thread and data...
156
click to vote
PKDD
2007
Springer
15 years 10 months ago
2007
Springer
Recent years have seen the development of many graph clustering algorithms, which can identify community structure in networks. The vast majority of these only find disjoint commun...
126
click to vote
STACS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We present a mathematical model to analyse the establishment and maintenance of communication between mobile agents. We assume that the agents move through a fixed envir...
123
click to vote
ICCSA
2010
Springer
15 years 6 months ago
2010
Springer
This paper achieves O(n3 log log n/ log n) time for the 2center problems on a directed graph with non-negative edge costs under the conventional RAM model where only arithmetic ope...
143
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...