APPROX
2005
Springer
14 years 5 months ago
2005
Springer
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 squar...
ARITH
2007
IEEE
14 years 6 months ago
2007
IEEE
Abstract. We present efficient squaring formulae based on the Toom-Cook multiplication algorithm. The latter always requires at least one non-trivial constant division in the inte...