214 search results - page 12 / 43 » The node capacitated graph partitioning problem: A computati... |
106
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
We consider the problem of human-assisted graph search: given a directed acyclic graph with some (unknown) target node(s), we consider the problem of finding the target node(s) b...
107
Voted
DCOSS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We are interested in the problem of computing the average consensus in a distributed fashion on random geometric graphs. We describe a new algorithm called Multi-scale Go...
86
Voted
IFIPTCS
2010
14 years 10 months ago
2010
Most highly dynamic infrastructure-less networks have in common that the assumption of connectivity does not necessarily hold at a given instant. Still, communication routes can be...
120
Voted
ICCS
2009
Springer
15 years 7 months ago
2009
Springer
Irregular and sparse scientific computing programs frequently experience performance losses due to inefficient use of the memory system in most machines. Previous work has shown t...
109
click to vote
COCOON
2008
Springer
15 years 2 months ago
2008
Springer
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...