Pages that link to "Item:Q385488"
From MaRDI portal
The following pages link to Algorithms for the maximum \(k\)-club problem in graphs (Q385488):
Displaying 12 items.
- Two-phase heuristics for the \(k\)-club problem (Q337187) (← links)
- Finding large \(k\)-clubs in undirected graphs (Q488393) (← 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)
- On biconnected and fragile subgraphs of low diameter (Q1694912) (← links)
- Parsimonious formulations for low-diameter clusters (Q2220903) (← links)
- An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem (Q2242188) (← links)
- On the maximum small-world subgraph problem (Q2327623) (← links)
- Exact algorithms for the minimum \(s\)-club partitioning problem (Q2329904) (← links)
- Distance-Based Clique Relaxations in Networks: s-Clique and s-Club (Q2820114) (← links)
- On the 2-Club Polytope of Graphs (Q2957469) (← links)
- A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques (Q5085477) (← links)