Fast Graph Sampling Using Gershgorin Disc Alignment

Source code of our paper "Fast Graph Sampling Set Selection Using Gershgorin Disc Alignment". Very fast deterministic graph sampling algorithm without explicit eigen-decomposition.

Prerequisite

Matlab(>=R2015a)

How to run the code

Step 1. run setup.m to compile .cpp files
Step 2. run pathgraph_test.m as a path graph sampling example

Citation

@article{bai2020fast,
  title={Fast graph sampling set selection using gershgorin disc alignment},
  author={Bai, Yuanchao and Wang, Fen and Cheung, Gene and Nakatsukasa, Yuji and Gao, Wen},
  journal={IEEE Transactions on Signal Processing},
  volume={68},
  pages={2419--2434},
  year={2020},
  publisher={IEEE}
}