Pages that link to "Item:Q1977620"
From MaRDI portal
The following pages link to Heuristics for finding \(k\)-clubs in an undirected graph (Q1977620):
Displaying 29 items.
- Two-phase heuristics for the \(k\)-club problem (Q337187) (← links)
- Algorithms for the maximum \(k\)-club problem in graphs (Q385488) (← 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)
- On biconnected and fragile subgraphs of low diameter (Q1694912) (← links)
- Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments (Q1719617) (← links)
- Multivariate algorithmics for finding cohesive subnetworks (Q1736776) (← links)
- Parameterized computational complexity of finding small-diameter subgraphs (Q1758028) (← links)
- An opposition-based memetic algorithm for the maximum quasi-clique problem (Q2184091) (← links)
- Parsimonious formulations for low-diameter clusters (Q2220903) (← links)
- On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs (Q2242194) (← links)
- The maximum \(l\)-triangle \(k\)-club problem: complexity, properties, and algorithms (Q2273677) (← links)
- Exact algorithms for the minimum \(s\)-club partitioning problem (Q2329904) (← links)
- On structural parameterizations for the 2-club problem (Q2341718) (← links)
- The triangle \(k\)-club problem (Q2359790) (← links)
- Finding disjoint dense clubs in a social network (Q2636493) (← links)
- Distance-Based Clique Relaxations in Networks: s-Clique and s-Club (Q2820114) (← links)
- On the 2-Club Polytope of Graphs (Q2957469) (← links)
- Finding Disjoint Dense Clubs in an Undirected Graph (Q4632197) (← links)
- On Fault-Tolerant Low-Diameter Clusters in Graphs (Q5060794) (← links)
- Integer models and upper bounds for the 3‐club problem (Q5326766) (← links)
- On atomic cliques in temporal graphs (Q6043101) (← links)
- On solving simplified diversified top-\(k\,s\)-plex problem (Q6164387) (← links)
- Finding conserved low-diameter subgraphs in social and biological networks (Q6659091) (← links)
