The following pages link to Finding clubs in graph classes (Q400518):
Displaying 11 items.
- Optimal approximation algorithms for maximum distance-bounded subgraph problems (Q1635712) (← links)
- Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments (Q1719617) (← 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)
- On Distance-d Independent Set and Other Problems in Graphs with “few” Minimal Separators (Q3181057) (← links)
- Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems (Q3467873) (← links)
- On Fault-Tolerant Low-Diameter Clusters in Graphs (Q5060794) (← 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)
