214 search results - page 32 / 43 » The node capacitated graph partitioning problem: A computati... |
168
Voted
PODC
2012
ACM
13 years 6 months ago
2012
ACM
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
161
Voted
MOBICOM
2006
ACM
15 years 9 months ago
2006
ACM
Wireless sensor networks are tightly associated with the underlying environment in which the sensors are deployed. The global topology of the network is of great importance to bot...
152
Voted
ESA
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
128
Voted
STOC
2009
ACM
16 years 4 months ago
2009
ACM
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
137
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Abstract. Consider a weighted and undirected graph, possibly with self-loops, and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements correspon...