Pages that link to "Item:Q541693"
From MaRDI portal
The following pages link to Upper bounds and heuristics for the 2-club problem (Q541693):
Displaying 16 items.
- Two-phase heuristics for the \(k\)-club problem (Q337187) (← links)
- Algorithms for the maximum \(k\)-club problem in graphs (Q385488) (← links)
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs (Q448967) (← 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)
- 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)
- On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs (Q2242194) (← links)
- An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem (Q2255969) (← links)
- On structural parameterizations for the 2-club problem (Q2341718) (← links)
- The triangle \(k\)-club problem (Q2359790) (← links)
- Approximating maximum diameter-bounded subgraph in unit disk graphs (Q2665266) (← links)
- Distance-Based Clique Relaxations in Networks: s-Clique and s-Club (Q2820114) (← links)
- On the 2-Club Polytope of Graphs (Q2957469) (← links)
- Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs (Q5115768) (← links)
- Integer models and upper bounds for the 3‐club problem (Q5326766) (← links)
