Pages that link to "Item:Q2032141"

The following pages link to Hardness and tractability of the \(\gamma\)\textsf{-Complete Subgraph} problem (Q2032141):

Displaying 2 items.

• On the parameterized complexity of non-hereditary relaxations of clique (Q6549685) (← links)
• \( \gamma \)-clustering problems: classical and parametrized complexity (Q6615214) (← links)