| Waddling random walk: Fast and accurate mining of motif statistics in large graphs G Han, H Sethu 2016 IEEE 16th International Conference on Data Mining (ICDM), 181-190, 2016 | 62 | 2016 |
| Edge sample and discard: A new algorithm for counting triangles in large dynamic graphs G Han, H Sethu Proceedings of the 2017 IEEE/ACM International Conference on Advances in …, 2017 | 20 | 2017 |
| Closed walk sampler: An efficient method for estimating eigenvalues of large graphs G Han, H Sethu IEEE Transactions on Big Data 6 (1), 29-42, 2018 | 3 | 2018 |
| Closed walk sampler: An efficient method for estimating the spectral radius of large graphs G Han, H Sethu 2017 IEEE International Conference on Big Data (Big Data), 616-625, 2017 | 3 | 2017 |
| On counting triangles through edge sampling in large dynamic graphs G Han, H Sethu From Security to Community Detection in Social Networking Platforms, 133-157, 2019 | 2 | 2019 |
| Sampling algorithms for big graph analytics G Han Drexel University, 2018 | | 2018 |
