Superpolylogarithmic

The polylogarithmic bound on g is necessary. To see this, let f(x) = Σxᵢ, and let g(x) be |x|/2 (or any other superpolylogarithmic threshold).

Lindzey noticed that it is possible to speed-up several graph algorithms using switching to a lower number of edges - he obtained up to superpolylogarithmic speed-ups of algorithms for diameter, transitive closure, bipartite maximum matching and general maximum matching.