The following pages link to The centrality index of a graph (Q2525819):
Displaying 50 items.
- Generalized network measures based on modulus of families of walks (Q298245) (← links)
- Proximity, remoteness and distance eigenvalues of a graph (Q313783) (← links)
- Diffusion centrality: a paradigm to maximize spread in social networks (Q322073) (← links)
- Some results on approximate 1-median selection in metric spaces (Q418725) (← links)
- Modeling dependent gene expression (Q439142) (← links)
- Identifying the node spreading influence with largest \(k\)-core values (Q480268) (← links)
- Snapshot centrality indices in dynamic FIFO networks (Q662157) (← links)
- Measuring the flow of information among cities using the diffusion power (Q763787) (← links)
- PageRank centrality for temporal networks (Q822935) (← links)
- Coordinated influence on the opinions of social network members (Q827945) (← links)
- Formal style of Medersas buildings in North Africa (Q895596) (← links)
- Combinatorial network abstraction by trees and distances (Q954979) (← links)
- Centrality measure in graphs (Q977050) (← links)
- Graph-theoretical analysis of the Swiss road and railway networks over time (Q1035745) (← links)
- A maximum \(b\)-matching problem arising from median location models with applications to the roommates problem (Q1380926) (← links)
- Centrality and power in social networks: A game theoretic approach. (Q1402484) (← links)
- A modified weighted TOPSIS to identify influential nodes in complex networks (Q1619021) (← 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)
- Reachability for airline networks: fast algorithm for shortest path problem with time windows (Q1630997) (← links)
- Structure-oriented prediction in complex networks (Q1632515) (← links)
- Measuring centrality by a generalization of degree (Q1642790) (← links)
- A centrality measure for communication ability in weighted network (Q1673338) (← links)
- Graph-based point drift: graph centrality on the registration of point-sets (Q1677064) (← links)
- Scalable computational techniques for centrality metrics on temporally detailed social network (Q1688418) (← links)
- Influential nodes ranking in complex networks: an entropy-based approach (Q1694101) (← links)
- High-order degree and combined degree in complex networks (Q1720992) (← links)
- Tackling information asymmetry in networks: a new entropy-based ranking index (Q1756553) (← links)
- Identifying and ranking influential spreaders in complex networks by neighborhood coreness (Q1782576) (← links)
- Ranking the spreading ability of nodes in complex networks based on local structure (Q1782730) (← links)
- Identifying influential spreaders by weighted leaderrank (Q1782754) (← links)
- Proximity, remoteness and girth in graphs (Q1786868) (← links)
- Brand diagnostics: Mapping branding effects using consumer associative networks (Q1806812) (← links)
- Robustness on topology reconfiguration of complex networks: an entropic approach (Q1997949) (← links)
- A new measure of identifying influential nodes: efficiency centrality (Q2005232) (← links)
- Energy disruptive centrality with an application to criminal network (Q2025571) (← links)
- The effect of attacks on the railway network of Hungary (Q2045622) (← links)
- Spectral rank monotonicity on undirected networks (Q2086592) (← links)
- Optimal centrality computations within bounded clique-width graphs (Q2093567) (← links)
- Identification of node centrality based on Laplacian energy of networks (Q2111639) (← links)
- An efficient noisy binary search in graphs via Median approximation (Q2115863) (← links)
- Medians in median graphs and their cube complexes in linear time (Q2119403) (← 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)
- A Laplacian approach to stubborn agents and their role in opinion formation on influence networks (Q2141459) (← links)
- Discount pricing in word-of-mouth marketing: an optimal control approach (Q2149654) (← links)
- Compressive sensing of high betweenness centrality nodes in networks (Q2150293) (← links)
- Exploring the heterogeneity for node importance byvon Neumann entropy (Q2156143) (← links)
- Algorithm for determining the mutual impact of nodes in weighted directed graphs (Q2157011) (← links)
- Consensus reaching process in large-scale group decision making based on bounded confidence and social network (Q2158037) (← links)
