Identifying influential nodes in weighted complex networks by considering the importance of shortest paths
Abstract Numerous real-world networks, including those in communication, transportation, and social systems, inherently possess weighted structures. While traditional centrality metrics like degree, betweenness, and closeness centrality offer useful insights, they often overlook key aspects such as...
Saved in:
| Main Authors: | Xiaohong Wang, Zhenyu Wang |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2025-04-01
|
| Series: | Journal of Big Data |
| Subjects: | |
| Online Access: | https://doi.org/10.1186/s40537-025-01159-w |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Applying the Node Combination Algorithm to the Shortest Path Problem for a Logistics Firm
by: Kevser Arman, et al.
Published: (2022-12-01) -
The True Shortest Path of Obstacle Grid Graph Is Solved by SGP Vertex Extraction and Filtering Algorithm
by: Yijie Zhang, et al.
Published: (2025-06-01) -
Isolating Coefficient-Based Framework to Recognize Influential Nodes in Complex Networks
by: Buran Basha Mohammad, et al.
Published: (2024-01-01) -
Influential nodes recognition of diverse complex network based on deep learning
by: MA Yulei, et al.
Published: (2025-06-01) -
An Algorithm to Find the Shortest Path through Obstacles of Arbitrary Shapes and Positions in 2D
by: Gilles Labonté
Published: (2024-09-01)