214 search results - page 20 / 43 » The node capacitated graph partitioning problem: A computati... |
94
Voted
ADHOCNOW
2008
Springer
15 years 2 months ago
2008
Springer
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network...
118
Voted
PODC
2006
ACM
15 years 7 months ago
2006
ACM
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
129
click to vote
CORR
2012
Springer
13 years 8 months ago
2012
Springer
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
120
Voted
PODC
2006
ACM
15 years 7 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
151
Voted
ICDCS
2008
IEEE
15 years 7 months ago
2008
IEEE
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...