Author:
Andersen Reid,Gleich David F.,Mirrokni Vahab
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Clustering in Hypergraphs to Minimize Average Edge Service Time;ACM Transactions on Algorithms;2020-07-31
2. Discovering the Graph Structure in Clustering Results;Advances in Intelligent Systems and Computing;2018-12-06
3. Random Walk with Restart on Large Graphs Using Block Elimination;ACM Transactions on Database Systems;2016-06-30
4. BEAR;Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data;2015-05-27
5. Provably Fast Inference of Latent Features from Networks;Proceedings of the 24th International Conference on World Wide Web;2015-05-18