The following pages link to The triangle \(k\)-club problem (Q2359790):
Displaying 9 items.
- Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments (Q1719617) (← links)
- The parameterized complexity of \(s\)-club with triangle and seed constraints (Q2169965) (← links)
- On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs (Q2242194) (← links)
- On clique relaxation models in network analysis (Q2253535) (← links)
- An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem (Q2255969) (← links)
- The maximum \(l\)-triangle \(k\)-club problem: complexity, properties, and algorithms (Q2273677) (← links)
- On the maximum small-world subgraph problem (Q2327623) (← links)
- The parameterized complexity of \(s\)-club with triangle and seed constraints (Q6056631) (← links)
- Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs (Q6646734) (← links)
