The following pages link to On the 2-Club Polytope of Graphs (Q2957469):
Displaying 11 items.
- 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)
- Polyhedral properties of the induced cluster subgraphs (Q2022509) (← links)
- Parsimonious formulations for low-diameter clusters (Q2220903) (← links)
- An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem (Q2242188) (← links)
- On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs (Q2242194) (← links)
- Influence Maximization with Latency Requirements on Social Networks (Q5085986) (← links)
- Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem (Q5087709) (← links)
- Asymptotic bounds for clustering problems in random graphs (Q6196888) (← links)
- Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs (Q6646734) (← links)
- Finding conserved low-diameter subgraphs in social and biological networks (Q6659091) (← links)
