Pages that link to "Item:Q5268927"
From MaRDI portal
The following pages link to Finding groups with maximum betweenness centrality (Q5268927):
Displaying 13 items.
- Finding clique clusters with the highest betweenness centrality (Q724070) (← links)
- On exact solution approaches for the longest induced path problem (Q1999389) (← links)
- Detecting a most closeness-central clique in complex networks (Q2286965) (← links)
- An integer programming approach for finding the most and the least central cliques (Q2341092) (← links)
- Group centralization of network indices (Q2345606) (← links)
- Faster computation of successive bounds on the group betweenness centrality (Q4584868) (← 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)
- Finding the most degree-central walks and paths in a graph: exact and heuristic approaches (Q6167664) (← links)
- Finding groups with maximum betweenness centrality via integer programming with random path sampling (Q6183091) (← links)
- A survey on optimization studies of group centrality metrics (Q6659090) (← links)
