no code implementations • NeurIPS 2008 • Mark Herbster, Massimiliano Pontil, Sergio R. Galeano
Given an $n$-vertex weighted tree with structural diameter $S$ and a subset of $m$ vertices, we present a technique to compute a corresponding $m \times m$ Gram matrix of the pseudoinverse of the graph Laplacian in $O(n+ m^2 + m S)$ time.