1729 search results - page 240 / 346 » On Bounds for the k-Partitioning of Graphs |
175
click to vote
WALCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...
166
click to vote
CONEXT
2010
ACM
15 years 4 months ago
2010
ACM
Client-server networks are pervasive, fundamental, and include such key networks as the Internet, power grids, and road networks. In a client-server network, clients obtain a serv...
164
click to vote
ICTAI
2010
IEEE
15 years 4 months ago
2010
IEEE
In this paper, we introduce a new partial consistency for constraint networks which is called Structural Consistency of level w and is denoted w-SC consistency. This consistency i...
199
click to vote
IMC
2010
ACM
15 years 4 months ago
2010
ACM
The Internet topology data collected through traceroute exploration has been extensively studied in the past. In particular, a remarkable property of the Internet, the power-law s...
199
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...