Pages that link to "Item:Q2005232"
From MaRDI portal
The following pages link to A new measure of identifying influential nodes: efficiency centrality (Q2005232):
Displaying 20 items.
- Ranking the spreading influence of nodes in complex networks: an extended weighted degree centrality based on a remaining minimum degree decomposition (Q1632565) (← links)
- A new evidential methodology of identifying influential nodes in complex networks (Q1681656) (← links)
- Location of facility based on simulated annealing and ``ZKW'' algorithms (Q1992773) (← links)
- Dynamical analysis of an SE2IR information propagation model in social networks (Q2045333) (← links)
- An efficient forecasting method for time series based on visibility graph and multi-subgraph similarity (Q2113054) (← links)
- A novel method for forecasting time series based on directed visibility graph and improved random walk (Q2116557) (← links)
- Identifying influential nodes in complex networks based on AHP (Q2145579) (← links)
- An evidential link prediction method and link predictability based on Shannon entropy (Q2147680) (← links)
- The use of nodes attributes in social network analysis with an application to an international trade network (Q2148612) (← links)
- Measure the structure similarity of nodes in complex networks based on relative entropy (Q2148672) (← links)
- CPR-TOPSIS: a novel algorithm for finding influential nodes in complex networks based on communication probability and relative entropy (Q2162956) (← links)
- \(p\)-means centrality (Q2206143) (← links)
- Node similarity measuring in complex networks with relative entropy (Q2206597) (← links)
- A note on the interpretation of the efficiency centrality (Q2207873) (← links)
- Efficiency centrality in time-varying graphs (Q2220234) (← links)
- A centrality measure in dense networks based on two-way random walk betweenness (Q2246034) (← links)
- Mining important nodes in directed weighted complex networks (Q2398779) (← links)
- A novel method for forecasting time series based on fuzzy logic and visibility graph (Q2418342) (← links)
- GPN: A novel gravity model based on position and neighborhood to identify influential nodes in complex networks (Q5067504) (← links)
- Identifying critical nodes in complex networks based on neighborhood information (Q6559244) (← links)
