Pages that link to "Item:Q1758028"

The following pages link to Parameterized computational complexity of finding small-diameter subgraphs (Q1758028):

Displaying 8 items.

• Algorithms for the maximum \(k\)-club problem in graphs (Q385488) (← links)
• Finding clubs in graph classes (Q400518) (← 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)
• Optimal approximation algorithms for maximum distance-bounded subgraph problems (Q1635712) (← links)
• Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights (Q1640044) (← 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)