352 search results - page 19 / 71 » Partitioning Graphs into Connected Parts |
153
click to vote
CASES
2001
ACM
15 years 7 months ago
2001
ACM
We consider handheld computing devices which are connected to a server (or a powerful desktop machine) via a wireless LAN. On such devices, it is often possible to save the energy...
112
click to vote
CLASSIFICATION
2008
15 years 4 months ago
2008
Let G = (V, E, w) be a graph with vertex and edge sets V and E, respectively, and w : E IR+ a function which assigns a positive weight or length to each edge of G. G is called a r...
139
Voted
COLT
2007
Springer
15 years 10 months ago
2007
Springer
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
117
click to vote
OPODIS
2007
15 years 5 months ago
2007
Abstract. Blin et al. (2006) proposed a distributed protocol that enables the smallest number of searchers to clear any unknown asynchronous graph in a decentralized manner. Unknow...
155
Voted
JPDC
2007
15 years 3 months ago
2007
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clus...