NFFT meets Krylov methods: Fast matrix-vector products for the graph Laplacian of fully connected networks.