1857 search results - page 211 / 372 » Minimum Degree Orderings |
305
click to vote
ICDE
2005
IEEE
16 years 7 months ago
2005
IEEE
Query processing in traditional information management systems has moved from an exact match model to more flexible paradigms allowing cooperative retrieval by aggregating the dat...
180
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We design the first efficient algorithms and prove new combinatorial bounds for list decoding tensor products of codes and interleaved codes. ? We show that for every code, the rat...
182
click to vote
HICSS
2010
IEEE
16 years 1 months ago
2010
IEEE
Numerous recent papers have found important relationships between network structure and risks within networks. These results indicate that network structure can dramatically affec...
189
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
184
click to vote
IWOCA
2009
Springer
16 years 1 months ago
2009
Springer
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...