V-E algorithm: a new vital vertex identifying algorithm based on vertex-edge interaction

DOI10.1142/S0217595921400133zbMATH Open1481.90101OpenAlexW3153515118MaRDI QIDQ5024904FDOQ5024904

Authors: Haoyu Wang, Xingqin Qi 

Publication date: 1 February 2022

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595921400133

Recommendations

• Vital nodes identification by the hybrid \(K\)-shell method based on vertex strength
• Identifying vital nodes in complex networks based on information entropy, minimum dominating set and distance
• A new method for identifying influential nodes and important edges in complex networks
• Identifying critical nodes in complex networks based on multi-scale centrality algorithm
• A fast greedy algorithm for the critical node detection problem

zbMATH Keywords

iterative algorithmcomplex networkscentrality measuresvital nodes identification

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Communication networks in operations research (90B18)

Cites Work

• Power-law distributions in empirical data
• A NEW MEASURE OF RANK CORRELATION
• An index to quantify an individual's scientific research output
• Authoritative sources in a hyperlinked environment
• Iterative Solution of Nonlinear Equations in Several Variables
• Title not available (Why is that?)
• Network centrality: an introduction
• Data based reconstruction of duplex networks

Uses Software

• plfit

This page was built for publication: V-E algorithm: a new vital vertex identifying algorithm based on vertex-edge interaction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5024904)