1952 search results - page 258 / 391 » Complete partitions of graphs |
194
click to vote
COMGEO
2007
ACM
15 years 6 months ago
2007
ACM
In this paper we investigate the relations between spanners, weak spanners, and power spanners in RD for any dimension D and apply our results to topology control in wireless netw...
227
click to vote
ECCC
2007
15 years 6 months ago
2007
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
168
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
166
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
189
click to vote
WWW
2003
ACM
16 years 7 months ago
2003
ACM
Recent advances in information retrieval over hyperlinked corpora have convincinglydemonstratedthat links carry less noisy information than text. We investigate the feasibility of...