Pages that link to "Item:Q1683124"

The following pages link to Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124):

Displayed 4 items.

• Graph classes and approximability of the happy set problem (Q2019476) ‎ (← links)
• Complexity and approximability of the happy set problem (Q2662689) ‎ (← links)
• Computing densest \(k\)-subgraph with structural parameters (Q2680362) ‎ (← links)
• On solving the densest<i>k</i>-subgraph problem on large graphs (Q5859000) ‎ (← links)