Pages that link to "Item:Q2286965"
From MaRDI portal
The following pages link to Detecting a most closeness-central clique in complex networks (Q2286965):
Displaying 11 items.
- Finding clique clusters with the highest betweenness centrality (Q724070) (← links)
- Energy disruptive centrality with an application to criminal network (Q2025571) (← links)
- Incentive rate determination in viral marketing (Q2029294) (← links)
- An integer programming approach for finding the most and the least central cliques (Q2341092) (← links)
- The Star Degree Centrality Problem: A Decomposition Approach (Q5084632) (← links)
- Finding Critical Links for Closeness Centrality (Q5138269) (← links)
- (Q5852580) (← links)
- Novel centrality metrics for studying essentiality in protein‐protein interaction networks based on group structures (Q6087561) (← 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)