Pages that link to "Item:Q2636493"
From MaRDI portal
The following pages link to Finding disjoint dense clubs in a social network (Q2636493):
Displaying 4 items.
- Hardness and tractability of the \(\gamma\)\textsf{-Complete Subgraph} problem (Q2032141) (← links)
- Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem (Q2424799) (← links)
- On the tractability of covering a graph with 2-clubs (Q5925691) (← links)
- Covering a graph with densest subgraphs (Q6659505) (← links)
