Pages that link to "Item:Q278378"
From MaRDI portal
The following pages link to A new betweenness centrality measure based on an algorithm for ranking the nodes of a network (Q278378):
Displaying 11 items.
- New highlights and a new centrality measure based on the adapted PageRank algorithm for urban networks (Q1733726) (← links)
- A variant of the current flow betweenness centrality and its application in urban networks (Q2008542) (← links)
- A centrality measure in dense networks based on two-way random walk betweenness (Q2246034) (← links)
- An algorithm for ranking the nodes of an urban network based on the concept of PageRank vector (Q2250244) (← links)
- Relative degree structural hole centrality, \(\mathrm{C}_{\mathrm{RD-SH}}\): a new centrality measure in complex networks (Q2330362) (← links)
- A novel method of evaluating key nodes in complex networks (Q2410521) (← links)
- Network descriptors based on betweenness centrality and transmission and their extremal values (Q2444560) (← links)
- An algorithm for ranking the nodes of multiplex networks with data based on the PageRank concept (Q2662531) (← links)
- Extending the Adapted PageRank Algorithm centrality model for urban street networks using non-local random walks (Q2698188) (← links)
- New Centrality Measures in Networks (Q4956940) (← links)
- A hierarchical walk-based measure of centrality based on reachability between strongly connected components in a digraph (Q5036323) (← links)
