Recent advances in fully dynamic graph algorithms–a quick reference guide

K Hanauer, M Henzinger, C Schulz - ACM Journal of Experimental …, 2022 - dl.acm.org
In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …

An improved influence maximization method for social networks based on genetic algorithm

JJ Lotf, MA Azgomi, MRE Dishabi - Physica A: Statistical Mechanics and its …, 2022 - Elsevier
Over the recent decade, much research has been conducted in the field of social networks.
The structure of these networks has been irregular, complex, and dynamic, and certain …

Centrality measures in complex networks: A survey

A Saxena, S Iyengar - arXiv preprint arXiv:2011.07190, 2020 - arxiv.org
In complex networks, each node has some unique characteristics that define the importance
of the node based on the given application-specific context. These characteristics can be …

Parallel and distributed graph neural networks: An in-depth concurrency analysis

M Besta, T Hoefler - IEEE Transactions on Pattern Analysis and …, 2024 - ieeexplore.ieee.org
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 …

NetworKit: A tool suite for large-scale complex network analysis

CL Staudt, A Sazonovs, H Meyerhenke - Network Science, 2016 - cambridge.org
We introduce NetworKit, an open-source software package for analyzing the structure of
large complex networks. Appropriate algorithmic solutions are required to handle …

Recent advances in fully dynamic graph algorithms

K Hanauer, M Henzinger, C Schulz - arXiv preprint arXiv:2102.11169, 2021 - arxiv.org
In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …

LGIEM: Global and local node influence based community detection

T Ma, Q Liu, J Cao, Y Tian, A Al-Dhelaan… - Future Generation …, 2020 - Elsevier
Community detection is one of the hot topics in the complex networks. It aims to find
subgraphs that are internally dense but externally sparsely connected. In this paper, a new …

Abra: Approximating betweenness centrality in static and dynamic graphs with rademacher averages

M Riondato, E Upfal - ACM Transactions on Knowledge Discovery from …, 2018 - dl.acm.org
ABPA Ξ A Σ (ABRAXAS): Gnostic word of mystic meaning. We present ABRA, a suite of
algorithms to compute and maintain probabilistically guaranteed high-quality …

Graph neural networks for fast node ranking approximation

SK Maurya, X Liu, T Murata - … on Knowledge Discovery from Data (TKDD …, 2021 - dl.acm.org
Graphs arise naturally in numerous situations, including social graphs, transportation
graphs, web graphs, protein graphs, etc. One of the important problems in these settings is …

TOSG: A topology optimization scheme with global small world for industrial heterogeneous Internet of Things

T Qiu, B Li, W Qu, E Ahmed… - IEEE Transactions on …, 2018 - ieeexplore.ieee.org
In Industrial Internet of Things (IIoT), sensor nodes are vulnerable to withstand node failures
due to energy exhaustion or external attacks, which leads to the low connectivity of …