Pages that link to "Item:Q297249"

The following pages link to Finding maximum subgraphs with relatively large vertex connectivity (Q297249):

Displaying 8 items.

• On robust clusters of minimum cardinality in networks (Q513606) (← 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)
• On exact solution approaches for the longest induced path problem (Q1999389) (← 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)
• On the maximum small-world subgraph problem (Q2327623) (← links)
• Finding groups with maximum betweenness centrality (Q5268927) (← links)