Pages that link to "Item:Q2917214"
From MaRDI portal
The following pages link to Clique Relaxation Models in Social Network Analysis (Q2917214):
Displayed 15 items.
- Social structure optimization in team formation (Q342472) (← links)
- An exact algorithm for the maximum probabilistic clique problem (Q405671) (← links)
- Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts (Q1634801) (← links)
- Frequency-driven tabu search for the maximum \(s\)-plex problem (Q1652378) (← links)
- Maximal strongly connected cliques in directed graphs: algorithms and bounds (Q1983136) (← links)
- Computing maximum \(k\)-defective cliques in massive graphs (Q2026994) (← links)
- Multi-wave tabu search for the Boolean quadratic programming problem with generalized upper bound constraints (Q2108178) (← links)
- An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem (Q2242188) (← links)
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem (Q2302299) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- Distance-Based Clique Relaxations in Networks: s-Clique and s-Club (Q2820114) (← links)
- On the 2-Club Polytope of Graphs (Q2957469) (← links)
- Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications (Q2980894) (← links)
- (Q5136240) (← links)
- On solving simplified diversified top-\(k\,s\)-plex problem (Q6164387) (← links)