The critical node detection problem in networks: A survey
M Lalou, MA Tahraoui, H Kheddouci - Computer Science Review, 2018 - Elsevier
In networks, not all nodes have the same importance, and some are more important than
others. The issue of finding the most important nodes in networks has been addressed …
others. The issue of finding the most important nodes in networks has been addressed …
A critical review of centrality measures in social networks
A Landherr, B Friedl, J Heidemann - Business & Information Systems …, 2010 - Springer
Social networks are currently gaining increasing impact in the light of the ongoing growth of
web-based services like facebook. com. One major challenge for the economically …
web-based services like facebook. com. One major challenge for the economically …
A survey of Twitter research: Data model, graph structure, sentiment analysis and attacks
Twitter is the third most popular worldwide Online Social Network (OSN) after Facebook and
Instagram. Compared to other OSNs, it has a simple data model and a straightforward data …
Instagram. Compared to other OSNs, it has a simple data model and a straightforward data …
Ligra: a lightweight graph processing framework for shared memory
J Shun, GE Blelloch - Proceedings of the 18th ACM SIGPLAN …, 2013 - dl.acm.org
There has been significant recent interest in parallel frameworks for processing graphs due
to their applicability in studying social networks, the Web graph, networks in biology, and …
to their applicability in studying social networks, the Web graph, networks in biology, and …
[图书][B] Networks, crowds, and markets: Reasoning about a highly connected world
D Easley, J Kleinberg - 2010 - academic.oup.com
The moment when the hyperconnectedness of our world became most evident to me was on
October 20th, 2011, when images of the death of Colonel Muammar el-Qaddafi, the former …
October 20th, 2011, when images of the death of Colonel Muammar el-Qaddafi, the former …
The Combinatorial BLAS: Design, implementation, and applications
A Buluç, JR Gilbert - The International Journal of High …, 2011 - journals.sagepub.com
This paper presents a scalable high-performance software library to be used for graph
analysis and data mining. Large combinatorial graphs appear in many applications of high …
analysis and data mining. Large combinatorial graphs appear in many applications of high …
Fast approximation of betweenness centrality through sampling
M Riondato, EM Kornaropoulos - … of the 7th ACM international conference …, 2014 - dl.acm.org
Betweenness centrality is a fundamental measure in social network analysis, expressing the
importance or influence of individual vertices in a network in terms of the fraction of shortest …
importance or influence of individual vertices in a network in terms of the fraction of shortest …
Ranking of closeness centrality for large-scale social networks
Closeness centrality is an important concept in social network analysis. In a graph
representing a social network, closeness centrality measures how close a vertex is to all …
representing a social network, closeness centrality measures how close a vertex is to all …
[图书][B] Discrete calculus: Applied analysis on graphs for computational science
LJ Grady, JR Polimeni - 2010 - Springer
The field of discrete calculus, also known as" discrete exterior calculus", focuses on finding a
proper set of definitions and differential operators that make it possible to operate the …
proper set of definitions and differential operators that make it possible to operate the …
Parallel and distributed graph neural networks: An in-depth concurrency analysis
Graph neural networks (GNNs) are among the most powerful tools in deep learning. They
routinely solve complex problems on unstructured networks, such as node classification …
routinely solve complex problems on unstructured networks, such as node classification …