APPROX
2007
Springer
13 years 11 months ago
2007
Springer
We initiate a systematic study of eigenvectors of random graphs. Whereas much is known about eigenvalues of graphs and how they reflect properties of the underlying graph, relati...
APPROX
2007
Springer
13 years 11 months ago
2007
Springer
We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popu...
APPROX
2007
Springer
13 years 11 months ago
2007
Springer
APPROX
2007
Springer
13 years 11 months ago
2007
Springer
: In the distribution-free property testing model, the distance between functions is measured with respect to an arbitrary and unknown probability distribution D over the input dom...
APPROX
2007
Springer
13 years 11 months ago
2007
Springer
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
APPROX
2007
Springer
13 years 11 months ago
2007
Springer
We study the cover time of a random walk on the random digraph Dn,p when np =
APPROX
2007
Springer
13 years 11 months ago
2007
Springer
APPROX
2007
Springer
13 years 11 months ago
2007
Springer
APPROX
2007
Springer
13 years 11 months ago
2007
Springer
APPROX
2007
Springer
13 years 11 months ago
2007
Springer
