Pages that link to "Item:Q4914440"
From MaRDI portal
The following pages link to Exact and Approximation Algorithms for Densest k-Subgraph (Q4914440):
Displaying 9 items.
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
- Graph classes and approximability of the happy set problem (Q2019476) (← links)
- Parameterized approximability of maximizing the spread of influence in networks (Q2250539) (← links)
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725) (← links)
- Parameterized algorithms for graph partitioning problems (Q2408556) (← links)
- Exact algorithms for problems related to the densest \(k\)-set problem (Q2448865) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- Complexity and approximability of the happy set problem (Q2662689) (← links)
- Parameterized algorithms for the happy set problem (Q5919103) (← links)
