Pages that link to "Item:Q3507332"
From MaRDI portal
The following pages link to Ranking of Closeness Centrality for Large-Scale Social Networks (Q3507332):
Displayed 6 items.
- Graph-based point drift: graph centrality on the registration of point-sets (Q1677064) (← links)
- I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs (Q2293164) (← links)
- Heuristical top-\(k\): fast estimation of centralities in complex networks (Q2448118) (← links)
- Properties of vector embeddings in social networks (Q2633162) (← links)
- Optimal Controlled Nodes Selection for Fast Consensus (Q2828531) (← links)
- Relating centralities in graphs and the principal eigenvector of its distance matrix (Q5027710) (← links)