Pages that link to "Item:Q2422030"
From MaRDI portal
The following pages link to On the tractability of finding disjoint clubs in a network (Q2422030):
Displaying 9 items.
- Finding clubs in graph classes (Q400518) (← links)
- Covering with clubs: complexity and approximability (Q1670995) (← links)
- Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments (Q1719617) (← links)
- On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs (Q2242194) (← links)
- Finding disjoint dense clubs in a social network (Q2636493) (← links)
- On 2-clubs in graph-based data clustering: theory and algorithm engineering (Q2692726) (← links)
- The disjoint cliques problem (Q4345417) (← links)
- On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering (Q5084692) (← links)
- On the tractability of covering a graph with 2-clubs (Q5925691) (← links)