Funder
Ministry of Education, Science and Technology
Publisher
Springer Science and Business Media LLC
Reference44 articles.
1. Ahn KJ, Guha S, McGregor A (2012) Graph sketches: sparsification, spanners, and subgraphs. In: Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems. ACM, pp 5–14
2. Kalavri V, Simas T, Logothetis D (2016) The shortest path is not always a straight line: leveraging semi-metricity in graph analysis. Proc VLDB Endowment 9(9):672–683
3. Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E 78(4):046110
4. Aggarwal CC, Wang H (2010) A survey of clustering algorithms for graph data. In Managing and mining graph data. Springer, Boston, pp 275–301
5. Sadhanala V, Wang Y-X, Tibshirani R (2016) Graph sparsification approaches for laplacian smoothing. In: Artificial Intelligence and Statistics, pp 1250–1259
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献