Pages that link to "Item:Q724070"

The following pages link to Finding clique clusters with the highest betweenness centrality (Q724070):

Displaying 8 items.

• The maximum clique interdiction problem (Q1735171) (← links)
• Energy disruptive centrality with an application to criminal network (Q2025571) (← links)
• Detecting a most closeness-central clique in complex networks (Q2286965) (← links)
• A new branch-and-bound algorithm for the maximum edge-weighted clique problem (Q2424766) (← links)
• The Star Degree Centrality Problem: A Decomposition Approach (Q5084632) (← 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)