Pages that link to "Item:Q3507332"
From MaRDI portal
The following pages link to Ranking of Closeness Centrality for Large-Scale Social Networks (Q3507332):
Displaying 12 items.
- Graph-based point drift: graph centrality on the registration of point-sets (Q1677064) (← links)
- CoVerD: community-based vertex defense against crawling adversaries (Q2086610) (← links)
- A simple centrality index for scientific social recognition (Q2148658) (← 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)
- (Q2987429) (← links)
- Relating centralities in graphs and the principal eigenvector of its distance matrix (Q5027710) (← links)
- Rank Centrality: Ranking from Pairwise Comparisons (Q5739125) (← links)
- Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis (Q5874469) (← links)
- A survey on optimization studies of group centrality metrics (Q6659090) (← links)
