Pages that link to "Item:Q2341092"
From MaRDI portal
The following pages link to An integer programming approach for finding the most and the least central cliques (Q2341092):
Displaying 12 items.
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs (Q276864) (← links)
- Finding clique clusters with the highest betweenness centrality (Q724070) (← links)
- A variable neighborhood search heuristic for the maximum ratio clique problem (Q1652431) (← links)
- An opposition-based memetic algorithm for the maximum quasi-clique problem (Q2184091) (← links)
- Graph signatures: identification and optimization (Q2242325) (← links)
- Detecting a most closeness-central clique in complex networks (Q2286965) (← links)
- The Star Degree Centrality Problem: A Decomposition Approach (Q5084632) (← links)
- Finding Critical Links for Closeness Centrality (Q5138269) (← links)
- Identification of Essential Proteins Using Induced Stars in Protein–Protein Interaction Networks (Q5139626) (← 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 the most degree-central walks and paths in a graph: exact and heuristic approaches (Q6167664) (← links)
