A Fast Method to Predict the Labeling of a Tree
Published on Feb 4, 20253200 Views
Given an n vertex weighted tree with (structural) diameter SG and a set of ` vertices we give a method to compute the corresponding `×` Gram matrix of the pseudoinverse of the graph Laplacian in O(n +