Pages that link to "Item:Q2242194"
From MaRDI portal
The following pages link to On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs (Q2242194):
Displaying 8 items.
- Finding maximum subgraphs with relatively large vertex connectivity (Q297249) (← links)
- Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems (Q439496) (← 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)
- An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem (Q2255969) (← links)
- On the 2-Club Polytope of Graphs (Q2957469) (← links)
- On Fault-Tolerant Low-Diameter Clusters in Graphs (Q5060794) (← links)
- On maximum ratio clique relaxations (Q6085884) (← links)