The following pages link to (Q5852580):
Displaying 14 items.
- On the maximum betweenness improvement problem (Q737099) (← links)
- Efficient algorithms for game-theoretic betweenness centrality (Q899439) (← links)
- A measure for a balanced workload and its extremal values (Q906433) (← links)
- Incremental deployment of network monitors based on Group Betweenness Centrality (Q990953) (← links)
- Potential-based bounded-cost search and anytime non-parametric A* (Q2014923) (← links)
- An integer programming approach for finding the most and the least central cliques (Q2341092) (← links)
- Group centralization of network indices (Q2345606) (← links)
- Structural search and optimization in social networks (Q2815472) (← links)
- Maximum Betweenness Centrality: Approximability and Tractable Cases (Q3078375) (← links)
- A Dominating Set Based Approach to Identify Effective Leader Group of Social Network (Q4925306) (← links)
- Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs (Q5025042) (← links)
- Finding groups with maximum betweenness centrality (Q5268927) (← links)
- Novel centrality metrics for studying essentiality in protein‐protein interaction networks based on group structures (Q6087561) (← links)
- A survey on optimization studies of group centrality metrics (Q6659090) (← links)
