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 27 items.
- Two-phase heuristics for the \(k\)-club problem (Q337187) (← links)
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375) (← links)
- Combinatorial algorithms for the maximum \(k\)-plex problem (Q434188) (← links)
- Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems (Q439496) (← links)
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs (Q448967) (← links)
- Finding large \(k\)-clubs in undirected graphs (Q488393) (← links)
- Upper bounds and heuristics for the 2-club problem (Q541693) (← links)
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph (Q1600883) (← 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)
- Covering with clubs: complexity and approximability (Q1670995) (← links)
- On biconnected and fragile subgraphs of low diameter (Q1694912) (← links)
- Heuristics for finding \(k\)-clubs in an undirected graph (Q1977620) (← links)
- Parsimonious formulations for low-diameter clusters (Q2220903) (← 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)
- Local search for diversified top-\(k\) clique search problem (Q2289947) (← links)
- On the maximum small-world subgraph problem (Q2327623) (← links)
- Exact algorithms for the minimum \(s\)-club partitioning problem (Q2329904) (← links)
- The triangle \(k\)-club problem (Q2359790) (← links)
- Distance-Based Clique Relaxations in Networks: s-Clique and s-Club (Q2820114) (← links)
- On the 2-Club Polytope of Graphs (Q2957469) (← links)
- Clique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem (Q3013924) (← links)
- Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs (Q4899256) (← links)
- A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques (Q5085477) (← links)
- A polyhedral study of the maximum edge subgraph problem (Q5916096) (← links)
- A survey on optimization studies of group centrality metrics (Q6659090) (← links)
