1 citations · 2 across the 9 of their papers we have counts for
1 paper · 1 filter
Samuel Fernández-Menduiña, Eduardo Pavez, Antonio Ortega
This paper develops fast graph Fourier transform (GFT) algorithms with O(n log n) runtime complexity for rank-one updates of the path graph. We first show that several commonly-use…