Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

APPROX
2005
Springer

favoriteEmaildiscussreport

96views Algorithms» more APPROX 2005»

Derandomized Squaring of Graphs

13 years 10 months ago

Derandomized Squaring of Graphs

Download people.seas.harvard.edu

We introduce a “derandomized” analogue of graph squaring. This operation increases the connectivity of the graph (as measured by the second eigenvalue) almost as well as squaring the graph does, yet only increases the degree of the graph by a constant factor, instead of squaring the degree. One application of this product is an alternative proof of Reingold’s recent breakthrough result that S-T Connectivity in Undirected Graphs can be solved in deterministic logspace.

Eyal Rozenman, Salil P. Vadhan

Real-time Traffic

Algorithms | APPROX 2005 | Constant Factor | S-T Connectivity | Squaring |

claim paper

Related Content

» Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies

» Checking Polynomial Identities over any Field Towards a Derandomization

» Better lossless condensers through derandomized curve samplers

» Derandomizing the AhlswedeWinter matrixvalued Chernoff bound using pessimistic estimators ...

» Derandomized Constructions of kWise Almost Independent Permutations

» Derandomized Parallel Repetition of Structured PCPs

» Derandomizing homomorphism testing in general groups

» Derandomizing the AW matrixvalued Chernoff bound using pessimistic estimators and applicat...

» Bipartite roots of graphs

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	APPROX
Authors	Eyal Rozenman, Salil P. Vadhan

Comments (0)