Are there approximate fast fourier transforms on graphs?

Luc Le Magoarou, Rémi Gribonval. Are there approximate fast fourier transforms on graphs?. In 2016 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2016, Shanghai, China, March 20-25, 2016. pages 4811-4815, IEEE, 2016. [doi]

@inproceedings{MagoarouG16-0,
  title = {Are there approximate fast fourier transforms on graphs?},
  author = {Luc Le Magoarou and Rémi Gribonval},
  year = {2016},
  doi = {10.1109/ICASSP.2016.7472591},
  url = {http://dx.doi.org/10.1109/ICASSP.2016.7472591},
  researchr = {https://researchr.org/publication/MagoarouG16-0},
  cites = {0},
  citedby = {0},
  pages = {4811-4815},
  booktitle = {2016 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2016, Shanghai, China, March 20-25, 2016},
  publisher = {IEEE},
  isbn = {978-1-4799-9988-0},
}