Pages that link to "Item:Q5138269"
From MaRDI portal
The following pages link to Finding Critical Links for Closeness Centrality (Q5138269):
Displaying 10 items.
- Finding clique clusters with the highest betweenness centrality (Q724070) (← links)
- Detecting a most closeness-central clique in complex networks (Q2286965) (← links)
- I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs (Q2293164) (← links)
- Ranking of Closeness Centrality for Large-Scale Social Networks (Q3507332) (← links)
- Fortification Against Cascade Propagation Under Uncertainty (Q5084610) (← links)
- Disjoint multipath closeness centrality (Q6103302) (← links)
- On designing networks resilient to clique blockers (Q6106962) (← links)
- The stochastic pseudo-star degree centrality problem (Q6112539) (← links)
- Finding the most degree-central walks and paths in a graph: exact and heuristic approaches (Q6167664) (← links)
- A survey on optimization studies of group centrality metrics (Q6659090) (← links)