Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

Identifying significant edges via neighborhood information
Na Zhao, Jie Li, Jian Wang, et al.
Physica A Statistical Mechanics and its Applications (2019) Vol. 548, pp. 123877-123877
Open Access | Times Cited: 17

Showing 17 citing articles:

A novel potential edge weight method for identifying influential nodes in complex networks based on neighborhood and position
Lei Meng, Guiqiong Xu, Pingle Yang, et al.
Journal of Computational Science (2022) Vol. 60, pp. 101591-101591
Closed Access | Times Cited: 41
Finding the key nodes to minimize the victims of the malicious information in complex network
Mingyang Zhou, Hongwu Liu, Hao Liao, et al.
Knowledge-Based Systems (2024) Vol. 293, pp. 111632-111632
Closed Access | Times Cited: 7
Quantifying the importance of specific types of higher-order structures in complex networks
Jiahui Song
Computer Networks (2024) Vol. 241, pp. 110200-110200
Closed Access | Times Cited: 2
IS-GNN: Graph neural network enhanced by aggregating influential and structurally similar nodes
Wenxin Yang, Longjie Li, Shenshen Bai, et al.
Knowledge-Based Systems (2024) Vol. 301, pp. 112282-112282
Closed Access | Times Cited: 2
Improving graph neural network via complex-network-based anchor structure
Lijun Dong, Hong Yao, Dan Li, et al.
Knowledge-Based Systems (2021) Vol. 233, pp. 107528-107528
Closed Access | Times Cited: 13
$$\text {BC}_{\mathrm {DCN}}$$: a new edge centrality measure to identify and rank critical edges pertaining to SIR diffusion in complex networks
Kushal Kanwar, Sakshi Kaushal, Harish Kumar, et al.
Social Network Analysis and Mining (2022) Vol. 12, Iss. 1
Closed Access | Times Cited: 9
A perturbation-based approach to identifying potentially superfluous network constituents
Timo Bröhl, Klaus Lehnertz
Chaos An Interdisciplinary Journal of Nonlinear Science (2023) Vol. 33, Iss. 6
Open Access | Times Cited: 4
Exact analysis of generalized degree-based percolation without memory
Jihui Han, Ge ZHANG, Gaogao Dong, et al.
Physica A Statistical Mechanics and its Applications (2024) Vol. 642, pp. 129776-129776
Closed Access | Times Cited: 1
Important edge identification in complex networks based on local and global features
Jia-Hui Song
Chinese Physics B (2022) Vol. 32, Iss. 9, pp. 098901-098901
Closed Access | Times Cited: 4
Finding Important Edges in Networks through Local Information
Enyu Yu, Yan Fu, Junlin Zhou, et al.
2021 7th International Conference on Computer and Communications (ICCC) (2021), pp. 2225-2229
Open Access | Times Cited: 5
Synergistic Integration of Local and Global Information for Critical Edge Identification
Na Zhao, Ting Luo, Hao Wang, et al.
Entropy (2024) Vol. 26, Iss. 11, pp. 933-933
Open Access
Identifying vital edges based on the cycle structure in complex networks
Wenjun Jiang, Peiyan Li, Ting Li, et al.
Physics Letters A (2024), pp. 130137-130137
Closed Access
A Key Node Mining Method Based on K-Shell and Neighborhood Information
Na Zhao, Qingchun Feng, Hao Wang, et al.
Applied Sciences (2024) Vol. 14, Iss. 14, pp. 6012-6012
Open Access
WEA: A Node Importance Algorithm in Weighted Networks
Na Zhao, Linjie Chen, Jie Li, et al.
(2023)
Open Access | Times Cited: 1
Assessing edge-coupled interdependent network disintegration via rank aggregation and elite enumeration
Yong-Hui 咏徽 Li 李, San-Yang 三阳 Liu 刘, Yi-Guang 艺光 Bai 白
Chinese Physics B (2023) Vol. 32, Iss. 11, pp. 118901-118901
Closed Access
WEM: A Node Importance Algorithm in Weighted Networks
Linjie Chen, Na Zhao, Jie Li, et al.
arXiv (Cornell University) (2021)
Open Access
Network Embedding Based Collaborative Filtering Model Equipped With User Purchase Motivation and Potential Interactions
Shuo Wang, Hui Zhou, Mingxin Li, et al.
2022 IEEE 8th International Conference on Cloud Computing and Intelligent Systems (CCIS) (2021), pp. 42-46
Closed Access
Page 1

Scroll to top