Derandomized Squaring of Graphs

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.

• Type: Conference
• Year: 2005
• Where: APPROX
• Authors: Eyal Rozenman, Salil P. Vadhan
• Keywords: Algorithms, APPROX 2005, Constant Factor, S-T Connectivity, Squaring