Pages that link to "Item:Q1782730"
From MaRDI portal
The following pages link to Ranking the spreading ability of nodes in complex networks based on local structure (Q1782730):
Displaying 20 items.
- Identifying influential spreaders by weight degree centrality in complex networks (Q508182) (← links)
- A new centrality measure based on the negative and positive effects of clustering coefficient for identifying influential spreaders in complex networks (Q721731) (← links)
- PageRank centrality for temporal networks (Q822935) (← links)
- A modified weighted TOPSIS to identify influential nodes in complex networks (Q1619021) (← links)
- Ranking the spreading influence of nodes in complex networks: an extended weighted degree centrality based on a remaining minimum degree decomposition (Q1632565) (← links)
- Influential nodes ranking in complex networks: an entropy-based approach (Q1694101) (← links)
- A new measure of identifying influential nodes: efficiency centrality (Q2005232) (← links)
- Identifying influential spreaders in complex networks based on improved k-shell method (Q2139312) (← links)
- Identifying influential nodes in complex networks based on AHP (Q2145579) (← links)
- Scalable influence maximization based on influential seed successors (Q2152927) (← links)
- A new centrality measure based on random walks for multilayer networks under the framework of tensor computation (Q2160096) (← links)
- Target users' activation probability maximization with different seed set constraints in social networks (Q2197539) (← links)
- Co-ranking for nodes, layers and timestamps in multilayer temporal networks (Q2213043) (← links)
- Identifying influential spreaders based on edge ratio and neighborhood diversity measures in complex networks (Q2218460) (← links)
- A new local and multidimensional ranking measure to detect spreaders in social networks (Q2218482) (← links)
- Efficiency centrality in time-varying graphs (Q2220234) (← links)
- Community based acceptance probability maximization for target users on social networks: algorithms and analysis (Q2283014) (← links)
- A novel method of evaluating key nodes in complex networks (Q2410521) (← links)
- A general higher-order supracentrality framework based on motifs of temporal networks and multiplex networks (Q2689678) (← links)
- A new method for identifying influential nodes and important edges in complex networks (Q2825285) (← links)