| Tài liệu tham khảo |
Loại |
Chi tiết |
| [12] M. Bentert, A. Dittmann, L. Kellerhals, A. Nichterlein, and R. Niedermeier. An adap- tive version of brandes’ algorithm for betweenness centrality. Computing Research Repository-CoRR, abs/1802.06701, 2018. URL http://arxiv.org/abs/1802.06701 |
Sách, tạp chí |
| Tiêu đề: |
An Adaptive Version of Brandes’ Algorithm for Betweenness Centrality |
| Tác giả: |
M. Bentert, A. Dittmann, L. Kellerhals, A. Nichterlein, R. Niedermeier |
| Nhà XB: |
Computing Research Repository-CoRR |
| Năm: |
2018 |
|
| [13] M. Bernaschi, G. Carbone, and F. Vella. Scalable betweenness centrality on multi-gpu systems. In Proceedings of the ACM International Conference on Computing Frontiers, CF ’16, pages 29–36, New York, NY, USA, 2016. ACM. ISBN 978-1-4503-4128-8. doi |
Sách, tạp chí |
| Tiêu đề: |
Scalable betweenness centrality on multi-gpu systems |
| Tác giả: |
M. Bernaschi, G. Carbone, F. Vella |
| Nhà XB: |
ACM |
| Năm: |
2016 |
|
| [14] P. Boldi and S. Vigna. Axioms for centrality. Internet Mathematics, 10(3-4):222–262, 2014. doi: 10.1080/15427951.2013.865686 |
Sách, tạp chí |
| Tiêu đề: |
Axioms for centrality |
| Tác giả: |
P. Boldi, S. Vigna |
| Nhà XB: |
Internet Mathematics |
| Năm: |
2014 |
|
| [15] U. Brandes. A faster algorithm for betweenness centrality. The Journal of Mathematical Sociology, 25(2):163–177, 2001. doi: 10.1080/0022250X.2001.9990249 |
Sách, tạp chí |
| Tiêu đề: |
A faster algorithm for betweenness centrality |
| Tác giả: |
U. Brandes |
| Nhà XB: |
The Journal of Mathematical Sociology |
| Năm: |
2001 |
|
| [16] E. Bullmore and O. Sporns. Complex brain networks: graph theoretical analysis of structural and functional systems. Nature Rev. Neurosci., 10:186–198, 3 2009. doi:10.1038/nrn2575 |
Sách, tạp chí |
| Tiêu đề: |
Complex brain networks: graph theoretical analysis of structural and functional systems |
| Tác giả: |
E. Bullmore, O. Sporns |
| Nhà XB: |
Nature Rev. Neurosci. |
| Năm: |
2009 |
|
| [19] V. T. Chakaravarthy, F. Checconi, F. Petrini, and Y. Sabharwal. Scalable single source shortest path algorithms for massively parallel systems. In 2014 IEEE 28th International Parallel and Distributed Processing Symposium, pages 889–901, May 2014. doi: 10.1109/IPDPS.2014.96 |
Sách, tạp chí |
| Tiêu đề: |
Scalable single source shortest path algorithms for massively parallel systems |
| Tác giả: |
V. T. Chakaravarthy, F. Checconi, F. Petrini, Y. Sabharwal |
| Nhà XB: |
IEEE |
| Năm: |
2014 |
|
| [20] M. H. Chehreghani. An efficient algorithm for approximate betweenness centrality computation. The Computer Journal, 57(9):1371–1382, Sept 2014. ISSN 0010-4620.doi: 10.1093/comjnl/bxu003 |
Sách, tạp chí |
| Tiêu đề: |
An efficient algorithm for approximate betweenness centrality computation |
| Tác giả: |
M. H. Chehreghani |
| Nhà XB: |
The Computer Journal |
| Năm: |
2014 |
|
| [21] D. Chen, L. L¨ u, M.-S. Shang, Y.-C. Zhang, and T. Zhou. Identifying influential nodes in complex networks. Physica A: Statistical Mechanics and its Applications, 391(4):1777 – 1787, 2012. ISSN 0378-4371. doi: https://doi.org/10.1016/j.physa.2011.09.017.URL http://www.sciencedirect.com/science/article/pii/S0378437111007333 |
Sách, tạp chí |
| Tiêu đề: |
Identifying influential nodes in complex networks |
| Tác giả: |
D. Chen, L. Lü, M.-S. Shang, Y.-C. Zhang, T. Zhou |
| Nhà XB: |
Physica A: Statistical Mechanics and its Applications |
| Năm: |
2012 |
|
| [22] Y. Cheng, F. Wang, H. Jiang, Y. Hua, D. Feng, Y. Wu, T. Zhu, and W. Guo. A highly cost-effective task scheduling strategy for very large graph computation. Future Generation Computer Systems, 89:698 – 712, 2018. ISSN 0167-739X. doi: https://doi.org/10.1016/j.future.2018.07.010. URL http://www.sciencedirect.com/science/article/pii/S0167739X17323683 |
Sách, tạp chí |
| Tiêu đề: |
A highly cost-effective task scheduling strategy for very large graph computation |
| Tác giả: |
Y. Cheng, F. Wang, H. Jiang, Y. Hua, D. Feng, Y. Wu, T. Zhu, W. Guo |
| Nhà XB: |
Future Generation Computer Systems |
| Năm: |
2018 |
|
| [23] B. Chikhaoui, M. Chiazzaro, S. Wang, and M. Sotir. Detecting communities of author- ity and analyzing their influence in dynamic social networks. ACM Trans. Intell. Syst.Technol., 8(6):82:1–82:28, Aug. 2017. ISSN 2157-6904. doi: 10.1145/3070658. URL http://doi.acm.org/10.1145/3070658 |
Sách, tạp chí |
| Tiêu đề: |
Detecting communities of authority and analyzing their influence in dynamic social networks |
| Tác giả: |
B. Chikhaoui, M. Chiazzaro, S. Wang, M. Sotir |
| Nhà XB: |
ACM Trans. Intell. Syst. Technol. |
| Năm: |
2017 |
|
| [24] A. Ching. Scaling apache giraph to a trillion edges. https://www.facebook.com/notes/facebook-engineering/scaling-apache-giraph-to-a-trillion-edges/10151617006153920 |
Sách, tạp chí |
| Tiêu đề: |
Scaling apache giraph to a trillion edges |
| Tác giả: |
A. Ching |
|
| [25] A. Ching, S. Edunov, M. Kabiljo, D. Logothetis, and S. Muthukrishnan. One trillion edges: Graph processing at facebook-scale. Proc. VLDB Endow., 8(12):1804–1815, Aug. 2015. ISSN 2150-8097. doi: 10.14778/2824032.2824077. URL http://dx.doi.org/10.14778/2824032.2824077 |
Sách, tạp chí |
| Tiêu đề: |
One trillion edges: Graph processing at facebook-scale |
| Tác giả: |
A. Ching, S. Edunov, M. Kabiljo, D. Logothetis, S. Muthukrishnan |
| Nhà XB: |
Proc. VLDB Endow. |
| Năm: |
2015 |
|
| [27] S. Das. Efficient algorithms for analyzing large scale network dynamics: Centrality, community and predictability. PhD thesis, Missouri University of Science and Tech- nology, 2018 |
Sách, tạp chí |
| Tiêu đề: |
Efficient algorithms for analyzing large scale network dynamics: Centrality, community and predictability |
| Tác giả: |
S. Das |
| Nhà XB: |
Missouri University of Science and Technology |
| Năm: |
2018 |
|
| [30] S. Duggirala. Newsql databases and scalable in-memory analytics. In P. Raj and G. C.Deka, editors, A Deep Dive into NoSQL Databases: The Use Cases and Applications, volume 109 of Advances in Computers, chapter 2, pages 49 – 76. Elsevier, 2018. doi:https://doi.org/10.1016/bs.adcom.2018.01.004. URL http://www.sciencedirect.com/science/article/pii/S0065245818300135 |
Sách, tạp chí |
| Tiêu đề: |
A Deep Dive into NoSQL Databases: The Use Cases and Applications |
| Tác giả: |
S. Duggirala, P. Raj, G. C. Deka |
| Nhà XB: |
Elsevier |
| Năm: |
2018 |
|
| [31] D. Eppstein and J. Wang. Fast approximation of centrality. In Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’01, pages 228–229, Philadelphia, PA, USA, 2001. Society for Industrial and Applied Mathe- matics. ISBN 0-89871-490-7. URL http://dl.acm.org/citation.cfm?id=365411.365449 |
Sách, tạp chí |
| Tiêu đề: |
Fast approximation of centrality |
| Tác giả: |
D. Eppstein, J. Wang |
| Nhà XB: |
Society for Industrial and Applied Mathematics |
| Năm: |
2001 |
|
| [32] D. Eppstein and J. Wang. Fast approximation of centrality. Journal of Graph Algorithms and Applications, 8(1):39–45, 2004. URL http://eudml.org/doc/52454 |
Sách, tạp chí |
| Tiêu đề: |
Fast approximation of centrality |
| Tác giả: |
D. Eppstein, J. Wang |
| Nhà XB: |
Journal of Graph Algorithms and Applications |
| Năm: |
2004 |
|
| [33] S. Even. Graph Algorithms. Cambridge University Press, 2nd edition, 2011. ISBN 0521736536 |
Sách, tạp chí |
| Tiêu đề: |
Graph Algorithms |
| Tác giả: |
S. Even |
| Nhà XB: |
Cambridge University Press |
| Năm: |
2011 |
|
| [34] R. Fan, K. Xu, and J. Zhao. A gpu-based solution for fast calculation of the betweenness centrality in large weighted networks. PeerJ Computer Science, 3:e140, Dec. 2017.ISSN 2376-5992. doi: 10.7717/peerj-cs.140. URL https://doi.org/10.7717/peerj- cs.140 |
Sách, tạp chí |
| Tiêu đề: |
A gpu-based solution for fast calculation of the betweenness centrality in large weighted networks |
| Tác giả: |
R. Fan, K. Xu, J. Zhao |
| Nhà XB: |
PeerJ Computer Science |
| Năm: |
2017 |
|
| [35] A. Farooq, G. J. Joyia, M. Uzair, and U. Akram. Detection of influential nodes using social networks analysis based on network metrics. In 2018 International Conference on Computing, Mathematics and Engineering Technologies (iCoMET), pages 1–6, March 2018. doi: 10.1109/ICOMET.2018.8346372 |
Sách, tạp chí |
| Tiêu đề: |
Detection of influential nodes using social networks analysis based on network metrics |
| Tác giả: |
A. Farooq, G. J. Joyia, M. Uzair, U. Akram |
| Nhà XB: |
2018 International Conference on Computing, Mathematics and Engineering Technologies (iCoMET) |
| Năm: |
2018 |
|
| 1016/j.trit.2016.03.011. URL http://www.sciencedirect.com/science/article/pii/S2468232216000123 |
Link |
|