Pages that link to "Item:Q1782576"

The following pages link to Identifying and ranking influential spreaders in complex networks by neighborhood coreness (Q1782576):

Displaying 45 items.

• Identifying the node spreading influence with largest \(k\)-core values (Q480268) (← links)
• 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)
• New trends in influence maximization models (Q826341) (← links)
• Investigating the relationship between \(k\)-core and \(s\)-core network decompositions (Q1619251) (← links)
• Identifying influential spreaders in complex networks based on gravity formula (Q1619389) (← links)
• Identification of influential nodes in complex networks: method from spreading probability viewpoint (Q1620311) (← links)
• 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)
• Influential nodes ranking in complex networks: an entropy-based approach (Q1694101) (← links)
• High-order degree and combined degree in complex networks (Q1720992) (← links)
• Identifying influential spreaders by weighted leaderrank (Q1782754) (← links)
• Density centrality: identifying influential nodes based on area density formula (Q2000310) (← links)
• Evaluation of community vulnerability based on communicability and structural dissimilarity (Q2088213) (← links)
• Identifying vital nodes in hypernetwork based on local centrality (Q2108524) (← links)
• Identifying influential spreaders in complex networks by considering the impact of the number of shortest paths (Q2121163) (← links)
• Identifying influential spreaders in complex networks based on improved k-shell method (Q2139312) (← links)
• Compressive sensing of high betweenness centrality nodes in networks (Q2150293) (← links)
• A new method for centrality measurement using generalized fuzzy graphs (Q2163619) (← links)
• Identifying influential nodes in social networks: a voting approach (Q2169571) (← links)
• Influential node detection of social networks based on network invulnerability (Q2212967) (← 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)
• Relative degree structural hole centrality, \(\mathrm{C}_{\mathrm{RD-SH}}\): a new centrality measure in complex networks (Q2330362) (← links)
• Identifying influential spreaders in artificial complex networks (Q2341565) (← links)
• Identifying multiple influential spreaders by a heuristic clustering algorithm (Q2406128) (← links)
• A novel method of evaluating key nodes in complex networks (Q2410521) (← links)
• Identification of influential spreaders based on classified neighbors in real-world complex networks (Q2423005) (← links)
• An effective heuristic clustering algorithm for mining multiple critical nodes in complex networks (Q2668298) (← links)
• Link importance assessment strategy based on improved \(k\)-core decomposition in complex networks (Q2686837) (← links)
• A new method for identifying influential nodes and important edges in complex networks (Q2825285) (← links)
• Core Decomposition, Maintenance and Applications (Q3297830) (← links)
• M-Centrality: identifying key nodes based on global position and local degree variation (Q3303303) (← links)
• Influence Maximization in Complex Networks Through Supervised Machine Learning (Q5050310) (← links)
• GPN: A novel gravity model based on position and neighborhood to identify influential nodes in complex networks (Q5067504) (← links)
• A novel centrality measure for identifying influential nodes based on minimum weighted degree decomposition (Q5068275) (← links)
• Dismantling complex networks based on the principal eigenvalue of the adjacency matrix (Q5129871) (← links)
• A new metric to quantify influence of nodes in social networks (Q5207180) (← links)
• Identifying and ranking influential spreaders in complex networks by combining a local-degree sum and the clustering coefficient (Q5212623) (← links)
• Syncretic K-shell algorithm for node importance identification and invulnerability evaluation of urban rail transit network (Q6072698) (← links)
• IDENTIFYING VITAL NODES IN COMPLEX NETWORK BY CONSIDERING MULTIPLEX INFLUENCES (Q6203428) (← links)
• Targeted \(k\)-node collapse problem: towards understanding the robustness of local \(k\)-core structure (Q6554856) (← links)
• Identifying critical nodes in complex networks based on neighborhood information (Q6559244) (← links)
• Identifying influential nodes in complex networks based on network embedding and local structure entropy (Q6607285) (← links)
• New metrics for influential spreaders identification in complex networks based on D-spectra of nodes (Q6650157) (← links)