Pages that link to "Item:Q2662531"
From MaRDI portal
The following pages link to An algorithm for ranking the nodes of multiplex networks with data based on the PageRank concept (Q2662531):
Displaying 10 items.
- A new betweenness centrality measure based on an algorithm for ranking the nodes of a network (Q278378) (← links)
- New highlights and a new centrality measure based on the adapted PageRank algorithm for urban networks (Q1733726) (← links)
- Ranking nodes in general networks: a Markov multi-chain approach (Q1745939) (← links)
- Identifying mobility patterns by means of centrality algorithms in multiplex networks (Q2243267) (← links)
- An algorithm for ranking the nodes of an urban network based on the concept of PageRank vector (Q2250244) (← links)
- A new ranking algorithm and an evolutionary model based on comprehensive weighted clique degree for complex network (Q2290278) (← links)
- A biplex approach to PageRank centrality: From classic to multiplex networks (Q4591844) (← links)
- (Q4984370) (← links)
- On PageRank versatility for multiplex networks: properties and some useful bounds (Q5135583) (← links)
- Joint degree distribution of growing multiplex network model with nonlinear preferential attachment rule (Q6535274) (← links)
