237 search results - page 25 / 48 » Improved Approximations of Independent Sets in Bounded-Degre... |
COCOON
2007
Springer
14 years 3 months ago
2007
Springer
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
TACAS
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Programs commonly maintain multiple linked data structures. Correlations between multiple data structures may often be nonexistent or irrelevant to verifying that the pro...
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
TCOM
2008
13 years 8 months ago
2008
The cumulative distribution function (cdf) of a sum of correlated or even independent lognormal random variables (RVs), which is of wide interest in wireless communications, remain...
AAIM
2011
Springer
13 years 12 days ago
2011
Springer
A star forest is a collection of vertex-disjoint trees of depth at most 1, and its size is the number of leaves in all its components. A spanning star forest of a given graph G is ...