{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T07:24:50Z","timestamp":1744183490655,"version":"3.37.3"},"reference-count":46,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11602235"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for China Central Universities","doi-asserted-by":"publisher","award":["2652018091","2652018107","2652018109"],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Future Generation Computer Systems"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1016\/j.future.2019.12.038","type":"journal-article","created":{"date-parts":[[2020,1,2]],"date-time":"2020-01-02T17:02:46Z","timestamp":1577984566000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":16,"special_numbering":"C","title":["Efficient parallel algorithm for detecting influential nodes in large biological networks on the Graphics Processing Unit"],"prefix":"10.1016","volume":"106","author":[{"given":"Lei","family":"Xiao","sequence":"first","affiliation":[]},{"given":"Shuangyan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Gang","family":"Mei","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.future.2019.12.038_b1","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S003614450342480","article-title":"The structure and function of complex networks","volume":"45","author":"Newman","year":"2003","journal-title":"SIAM Rev."},{"issue":"6092","key":"10.1016\/j.future.2019.12.038_b2","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1126\/science.1215842","article-title":"Identifying influential and susceptible members of social networks","volume":"337","author":"Aral","year":"2012","journal-title":"Science"},{"key":"10.1016\/j.future.2019.12.038_b3","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/j.future.2018.08.047","article-title":"Efficient method for identifying influential vertices in dynamic networks using the strategy of local detection and updating","volume":"91","author":"Wang","year":"2019","journal-title":"Future Gener. Comput. Syst."},{"key":"10.1016\/j.future.2019.12.038_b4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2017.05.001","article-title":"Ranking in evolving complex networks","volume":"689","author":"Liao","year":"2017","journal-title":"Phys. Rep."},{"key":"10.1016\/j.future.2019.12.038_b5","doi-asserted-by":"crossref","first-page":"10168","DOI":"10.1038\/ncomms10168","article-title":"The H-index of a network node and its relation to degree and coreness","volume":"7","author":"Lu","year":"2016","journal-title":"Nature Commun."},{"key":"10.1016\/j.future.2019.12.038_b6","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/j.future.2017.02.018","article-title":"QRE: Quick Robustness Estimation for large complex networks","volume":"83","author":"Wandelt","year":"2018","journal-title":"Future Gener. Comput. Syst."},{"issue":"1","key":"10.1016\/j.future.2019.12.038_b7","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1038\/s41567-018-0304-8","article-title":"The k-core as a predictor of structural collapse in mutualistic ecosystems","volume":"15","author":"Morone","year":"2018","journal-title":"Nat. Phys."},{"issue":"11","key":"10.1016\/j.future.2019.12.038_b8","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1038\/nphys1746","article-title":"Identification of influential spreaders in complex networks","volume":"6","author":"Kitsak","year":"2010","journal-title":"Nat. Phys."},{"key":"10.1016\/j.future.2019.12.038_b9","doi-asserted-by":"crossref","DOI":"10.1016\/j.physa.2019.121715","article-title":"The bi-directional h-index and B-core decomposition in directed networks","volume":"531","author":"Zhai","year":"2019","journal-title":"Physica A"},{"key":"10.1016\/j.future.2019.12.038_b10","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1016\/j.future.2016.10.019","article-title":"Social networking data analysis tools & challenges","volume":"86","author":"Sapountzi","year":"2018","journal-title":"Future Gener. Comput. Syst."},{"key":"10.1016\/j.future.2019.12.038_b11","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1016\/j.future.2018.07.015","article-title":"Influence maximization in large social networks: Heuristics, models and parameters","volume":"89","author":"Sumith","year":"2018","journal-title":"Future Gener. Comput. Syst. Int. J. Esci."},{"key":"10.1016\/j.future.2019.12.038_b12","doi-asserted-by":"crossref","first-page":"1491","DOI":"10.1016\/j.future.2017.05.050","article-title":"Maximizing positive influence spread in online social networks via fluid dynamics","volume":"86","author":"Wang","year":"2018","journal-title":"Future Gener. Comput. Syst. Int. J. Esci."},{"key":"10.1016\/j.future.2019.12.038_b13","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.future.2012.06.011","article-title":"Preference-based mining of top- influential nodes in social networks","volume":"31","author":"Zhou","year":"2014","journal-title":"Future Gener. Comput. Syst."},{"key":"10.1016\/j.future.2019.12.038_b14","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1016\/j.ins.2014.03.070","article-title":"Maximizing the spread of influence ranking in social networks","volume":"278","author":"Zhu","year":"2014","journal-title":"Inform. Sci."},{"issue":"3","key":"10.1016\/j.future.2019.12.038_b15","doi-asserted-by":"crossref","first-page":"1353","DOI":"10.1016\/j.eswa.2014.09.037","article-title":"A fast algorithm for finding most influential people based on the linear threshold model","volume":"42","author":"Rahimkhani","year":"2015","journal-title":"Expert Syst. Appl."},{"issue":"10","key":"10.1016\/j.future.2019.12.038_b16","doi-asserted-by":"crossref","first-page":"9788","DOI":"10.1016\/j.eswa.2012.02.175","article-title":"PAV: A novel model for ranking heterogeneous objects in bibliographic information networks","volume":"39","author":"Deng","year":"2012","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.future.2019.12.038_b17","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.advengsoft.2014.09.002","article-title":"Finding influential agent groups in complex multiagent software systems based on citation network analyses","volume":"79","author":"Jiang","year":"2015","journal-title":"Adv. Eng. Softw."},{"key":"10.1016\/j.future.2019.12.038_b18","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.future.2018.11.023","article-title":"Influential node ranking in social networks based on neighborhood diversity","volume":"94","author":"Zareie","year":"2019","journal-title":"Future Gener. Comput. Syst."},{"key":"10.1016\/j.future.2019.12.038_b19","doi-asserted-by":"crossref","first-page":"60957","DOI":"10.1109\/ACCESS.2019.2915508","article-title":"Identification of key nodes in aircraft state network based on complex network theory","volume":"7","author":"Zekun","year":"2019","journal-title":"IEEE Access"},{"issue":"1","key":"10.1016\/j.future.2019.12.038_b20","doi-asserted-by":"crossref","first-page":"2114","DOI":"10.1038\/s41467-019-10063-w","article-title":"Local floods induce large-scale abrupt failures of road networks","volume":"10","author":"Wang","year":"2019","journal-title":"Nature Commun."},{"key":"10.1016\/j.future.2019.12.038_b21","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/j.advengsoft.2018.03.002","article-title":"Parallel two-stage algorithms for solving the PageRank problem","volume":"125","author":"Migall\u00f3n","year":"2018","journal-title":"Adv. Eng. Softw."},{"key":"10.1016\/j.future.2019.12.038_b22","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/j.advengsoft.2016.01.024","article-title":"A heuristic relaxed extrapolated algorithm for accelerating PageRank","volume":"120","author":"Migall\u00f3n","year":"2018","journal-title":"Adv. Eng. Softw."},{"key":"10.1016\/j.future.2019.12.038_b23","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1016\/j.future.2016.10.019","article-title":"Social networking data analysis tools & challenges","volume":"86","author":"Sapountzi","year":"2018","journal-title":"Future Gener. Comput. Syst."},{"key":"10.1016\/j.future.2019.12.038_b24","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.cnsns.2016.11.008","article-title":"A new measure of identifying influential nodes: Efficiency centrality","volume":"47","author":"Wang","year":"2017","journal-title":"Commun. Nonlinear Sci. Numer. Simul."},{"key":"10.1016\/j.future.2019.12.038_b25","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1016\/j.future.2018.04.026","article-title":"A novel ITO Algorithm for influence maximization in the large-scale social networks","volume":"88","author":"Wang","year":"2018","journal-title":"Future Gener. Comput. Syst. Int. J. Esci."},{"key":"10.1016\/j.future.2019.12.038_b26","doi-asserted-by":"crossref","first-page":"1055","DOI":"10.1016\/j.future.2018.08.033","article-title":"SEIM: Search economics for influence maximization in online social networks","volume":"93","author":"Tsai","year":"2019","journal-title":"Future Gener. Comput. Syst. Int. J. Esci."},{"key":"10.1016\/j.future.2019.12.038_b27","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/j.jbi.2015.08.014","article-title":"MiRNA-TF-gene network analysis through ranking of biomolecules for multi-informative uterine leiomyoma dataset","volume":"57","author":"Mallik","year":"2015","journal-title":"J. Biomed. Inform."},{"issue":"1","key":"10.1016\/j.future.2019.12.038_b28","doi-asserted-by":"crossref","first-page":"2274","DOI":"10.1038\/s41467-018-04718-3","article-title":"Finding influential nodes for integration in brain networks using optimal percolation theory","volume":"9","author":"Del Ferraro","year":"2018","journal-title":"Nature Commun."},{"key":"10.1016\/j.future.2019.12.038_b29","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.ins.2018.04.078","article-title":"Identifying influential genes in protein\u2013protein interaction networks","volume":"454\u2013455","author":"Sun","year":"2018","journal-title":"Inform. Sci."},{"issue":"15","key":"10.1016\/j.future.2019.12.038_b30","doi-asserted-by":"crossref","first-page":"3849","DOI":"10.1073\/pnas.1620808114","article-title":"Model of brain activation predicts the neural collective influence map of the brain","volume":"114","author":"Morone","year":"2017","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"46","key":"10.1016\/j.future.2019.12.038_b31","doi-asserted-by":"crossref","first-page":"16569","DOI":"10.1073\/pnas.0507655102","article-title":"An index to quantify an individual\u2019s scientific research output","volume":"102","author":"Hirsch","year":"2005","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"3","key":"10.1016\/j.future.2019.12.038_b32","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1007\/s10766-017-0507-0","article-title":"MeshCleaner: A generic and straightforward algorithm for cleaning finite element meshes","volume":"46","author":"Mei","year":"2017","journal-title":"Int. J. Parallel Program."},{"key":"10.1016\/j.future.2019.12.038_b33","first-page":"475","article-title":"THRUST: a productivity-oriented library for CUDA","author":"Bell","year":"2017"},{"key":"10.1016\/j.future.2019.12.038_b34","doi-asserted-by":"crossref","first-page":"994","DOI":"10.1016\/j.future.2019.05.071","article-title":"A simple and generic paradigm for creating complex networks using the strategy of vertex selecting-and-pairing","volume":"100","author":"Wang","year":"2019","journal-title":"Future Gener. Comput. Syst."},{"key":"10.1016\/j.future.2019.12.038_b35","series-title":"2016 IEEE International Parallel and Distributed Processing Symposium Workshops","first-page":"740","article-title":"Counting triangles in large graphs on GPU","author":"Polak","year":"2016"},{"issue":"1","key":"10.1016\/j.future.2019.12.038_b36","doi-asserted-by":"crossref","DOI":"10.1016\/j.heliyon.2018.e00512","article-title":"A sample implementation for parallelizing Divide-and-Conquer algorithms on the GPU","volume":"4","author":"Mei","year":"2018","journal-title":"Heliyon"},{"year":"2016","series-title":"A parallel solution to finding nodal neighbors in generic meshes","author":"Mei","key":"10.1016\/j.future.2019.12.038_b37"},{"year":"2018","series-title":"BioSNAP datasets: Stanford biomedical network dataset collection","author":"Marinka Zitnik","key":"10.1016\/j.future.2019.12.038_b38"},{"year":"2010","series-title":"OpenMP ARB: The openMP API specification for parallel programming (2019)","key":"10.1016\/j.future.2019.12.038_b39"},{"issue":"2","key":"10.1016\/j.future.2019.12.038_b40","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/s00371-014-0924-7","article-title":"GPU-based polygonization and optimization for implicit surfaces","volume":"31","author":"Chen","year":"2015","journal-title":"Vis. Comput."},{"issue":"11","key":"10.1016\/j.future.2019.12.038_b41","doi-asserted-by":"crossref","first-page":"7907","DOI":"10.1007\/s13369-014-1406-y","article-title":"A generic paradigm for accelerating Laplacian-based mesh smoothing on the GPU","volume":"39","author":"Mei","year":"2014","journal-title":"Arab. J. Sci. Eng."},{"key":"10.1016\/j.future.2019.12.038_b42","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/j.future.2017.09.082","article-title":"Efficient IoT-based sensor BIG Data collection\u2013processing and analysis in smart buildings","volume":"82","author":"Plageras","year":"2018","journal-title":"Future Gener. Comput. Syst."},{"key":"10.1016\/j.future.2019.12.038_b43","first-page":"1","article-title":"A survey of internet of things (IoT) for geo-hazards prevention: applications, technologies, and challenges","author":"Mei","year":"2019","journal-title":"IEEE Internet Things J."},{"issue":"1","key":"10.1016\/j.future.2019.12.038_b44","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1109\/TSUSC.2018.2817043","article-title":"Advanced media-based smart big data on intelligent cloud systems","volume":"4","author":"Psannis","year":"2019","journal-title":"IEEE Trans. Sustain. Comput."},{"key":"10.1016\/j.future.2019.12.038_b45","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1016\/j.future.2017.04.039","article-title":"An efficient algorithm for media-based surveillance system (EAMSuS) in IoT smart city framework","volume":"83","author":"Memos","year":"2018","journal-title":"Future Gener. Comput. Syst."},{"issue":"1","key":"10.1016\/j.future.2019.12.038_b46","first-page":"27","article-title":"Algorithms for efficient digital media transmission over IoT and cloud networking","volume":"5","author":"Stergiou","year":"2018","journal-title":"J. Multimedia Inf. Syst."}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X19318187?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X19318187?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,6]],"date-time":"2020-03-06T13:45:42Z","timestamp":1583502342000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167739X19318187"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5]]},"references-count":46,"alternative-id":["S0167739X19318187"],"URL":"https:\/\/doi.org\/10.1016\/j.future.2019.12.038","relation":{},"ISSN":["0167-739X"],"issn-type":[{"type":"print","value":"0167-739X"}],"subject":[],"published":{"date-parts":[[2020,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Efficient parallel algorithm for detecting influential nodes in large biological networks on the Graphics Processing Unit","name":"articletitle","label":"Article Title"},{"value":"Future Generation Computer Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.future.2019.12.038","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}