Pages that link to "Item:Q990953"
From MaRDI portal
The following pages link to Incremental deployment of network monitors based on Group Betweenness Centrality (Q990953):
Displaying 8 items.
- 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)
- Heuristical top-\(k\): fast estimation of centralities in complex networks (Q2448118) (← links)
- Maximum Betweenness Centrality: Approximability and Tractable Cases (Q3078375) (← 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)
- Finding groups with maximum betweenness centrality via integer programming with random path sampling (Q6183091) (← links)
