Pages that link to "Item:Q488393"

The following pages link to Finding large \(k\)-clubs in undirected graphs (Q488393):

Displaying 20 items.

• 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)
• Algorithms and complexity of \(s\)-club cluster vertex deletion (Q2115849) (← links)
• The parameterized complexity of \(s\)-club with triangle and seed constraints (Q2169965) (← links)
• On structural parameterizations for the 2-club problem (Q2341718) (← links)
• On the tractability of finding disjoint clubs in a network (Q2422030) (← links)
• A hybrid artificial immune network for detecting communities in complex networks (Q2517303) (← links)
• Finding disjoint dense clubs in a social network (Q2636493) (← links)
• Approximating maximum diameter-bounded subgraph in unit disk graphs (Q2665266) (← links)
• On the 2-Club Polytope of Graphs (Q2957469) (← links)
• Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems (Q3467873) (← links)
• Finding Disjoint Dense Clubs in an Undirected Graph (Q4632197) (← links)
• On Fault-Tolerant Low-Diameter Clusters in Graphs (Q5060794) (← links)
• Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs (Q5115768) (← links)
• Covering a Graph with Clubs (Q5377354) (← links)
• On the tractability of covering a graph with 2-clubs (Q5925691) (← links)
• The parameterized complexity of \(s\)-club with triangle and seed constraints (Q6056631) (← links)
• Computing dense and sparse subgraphs of weakly closed graphs (Q6107896) (← links)