Identifying influential nodes in complex networks based on AHP
From MaRDI portal
Recommendations
- A modified weighted TOPSIS to identify influential nodes in complex networks
- Identifying influential nodes in complex networks from global perspective
- A new evidential methodology of identifying influential nodes in complex networks
- Identifying influential nodes in complex networks: a node information dimension approach
Cites work
- scientific article; zbMATH DE number 6013704 (Why is no real title available?)
- scientific article; zbMATH DE number 3943488 (Why is no real title available?)
- scientific article; zbMATH DE number 2209466 (Why is no real title available?)
- A Non-Parametric Test of Independence
- A faster algorithm for betweenness centrality*
- A modified weighted TOPSIS to identify influential nodes in complex networks
- A new aggregating operator for linguistic information based on D numbers
- A new measure of identifying influential nodes: efficiency centrality
- A new methodology of multicriteria decision-making in supplier selection based on \(Z\)-numbers
- Authorship recognition via fluctuation analysis of network topology and word intermittency
- Collective dynamics of `small-world' networks
- Epidemic spreading on heterogeneous networks with identical infectivity
- Exploring complex networks
- Ranking the spreading ability of nodes in complex networks based on local structure
- Statistical mechanics of complex networks
- THE TREATMENT OF TIES IN RANKING PROBLEMS
- The Structure and Function of Complex Networks
Cited in
(10)- The use of nodes attributes in social network analysis with an application to an international trade network
- Identifying node importance based on evidence theory in complex networks
- A modified weighted TOPSIS to identify influential nodes in complex networks
- A new evidential methodology of identifying influential nodes in complex networks
- Identifying influential nodes in complex networks: a node information dimension approach
- Ranking the spreading influence of nodes in complex networks: an extended weighted degree centrality based on a remaining minimum degree decomposition
- Evidential identification of influential nodes in network of networks
- Identifying influential nodes in complex networks from global perspective
- \(p\)-means centrality
- Syncretic K-shell algorithm for node importance identification and invulnerability evaluation of urban rail transit network
This page was built for publication: Identifying influential nodes in complex networks based on AHP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2145579)