Pages that link to "Item:Q2293164"

The following pages link to I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs (Q2293164):

Displaying 3 items.

• Optimizing node discovery on networks: problem definitions, fast algorithms, and observations (Q2201666) (← links)
• Detecting a most closeness-central clique in complex networks (Q2286965) (← links)
• A survey on optimization studies of group centrality metrics (Q6659090) (← links)