Publisher
Springer Science and Business Media LLC
Subject
Computer Science Applications,Computational Mechanics
Reference39 articles.
1. Alstrup S, Bille P, Rauhe T (2005) Labeling schemes for small distances in trees. SIAM J Discrete Math 19(2):448–462
2. Bader DA, Madduri K (2006) Parallel algorithms for evaluating centrality indices in real-world networks. In: ICPP, pp 539–550
3. Bader DA, Madduri K (2008) Snap, small-world network analysis and partitioning: an open-source parallel graph framework for the exploration of large-scale networks. In: IPDPS, pp 1–12
4. Bader DA, Kintali S, Madduri K, Mihail M (2007) Approximating betweenness centrality. In: WAW, pp 124–137
5. Brandtzæg PB, Heim J, Kaare BH (2010) Bridging and bonding in social network sites—investigating family-based capital. IJWBC 6(3):231–253
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Distributed Subgraph Query Processing Using Filtering Scores on Spark;Electronics;2023-08-29
2. Concatenated k-path covers;International Journal of Computer Mathematics: Computer Systems Theory;2023-01-02
3. Path Based Subgraph Searching in Distributed Environments;Lecture Notes in Electrical Engineering;2023
4. Categorical Depth Distribution Network for Monocular 3D Object Detection;2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR);2021-06
5. A new approach to solve opinion dynamics on complex networks;Expert Systems with Applications;2020-05