Pages that link to "Item:Q744705"
From MaRDI portal
The following pages link to A branch-and-bound approach for maximum quasi-cliques (Q744705):
Displaying 15 items.
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs (Q276864) (← links)
- Finding maximum subgraphs with relatively large vertex connectivity (Q297249) (← links)
- Finding clique clusters with the highest betweenness centrality (Q724070) (← links)
- Frequency-driven tabu search for the maximum \(s\)-plex problem (Q1652378) (← links)
- Multivariate algorithmics for finding cohesive subnetworks (Q1736776) (← links)
- Micro-review synthesis for multi-entity summarization (Q1741329) (← links)
- An opposition-based memetic algorithm for the maximum quasi-clique problem (Q2184091) (← links)
- An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem (Q2242188) (← links)
- The maximum \(l\)-triangle \(k\)-club problem: complexity, properties, and algorithms (Q2273677) (← links)
- On the maximum small-world subgraph problem (Q2327623) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- LP-based dual bounds for the maximum quasi-clique problem (Q2664003) (← links)
- An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph (Q3386796) (← links)
- An exact algorithm for the maximum quasi‐clique problem (Q6088204) (← links)
- On finding the community with maximum persistence probability (Q6655141) (← links)
